Let G=({S,T,U},{0,#},R,S), where R = {S TT | U; T TO | OT | #; U...

 

Transcribed Image Text:

Let G=({S,T,U},{0,#},R,S), where R = {S TT | U; T TO | OT | #; U 0U00 | #}. a. Describe the language L (in English) that is generated by the CFG G. b. Prove that the language L generated by the CFG G is not regular. Hint: Use the fact that regular languages are closed under union and prove that one component of the language is not regular by the Pumping Lemma. Let G=({S,T,U},{0,#},R,S), where R = {S TT | U; T TO | OT | #; U 0U00 | #}. a. Describe the language L (in English) that is generated by the CFG G. b. Prove that the language L generated by the CFG G is not regular. Hint: Use the fact that regular languages are closed under union and prove that one component of the language is not regular by the Pumping Lemma.