Suppose that G is a context-free grammar. How can I show that Is L(G) regular? is undecidable. Also, prove that L is always context-free but is regular if and only if L(G) = . This is what I have so farLet N be some language that is known to be context-free but not regular (for example, {a^nb^n | n  0}). Consider the language L = N#  #L(G), where # is some symbol that is not in L(G) or N. Where to? I just know my prof is going to put this on my exam :s.
Showing Context Free Grammars that are regular if and only if L(G) = .
regular languages;context free