(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

What is an algorithm which decides whether a context-free language is actually a subset of a regular language? That is, given CFL and RL, how do we decide whether CFL is a subset of RL?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: When Context Free is actually Regular

**Physics Forums | Science Articles, Homework Help, Discussion**