Question: Let the following two languages over the alphabet E= {a,b} be given: L = {ababka | k No} L2= {abkbka | ke No} Both

Let the following two languages over the alphabet E= {a,b} be given: 

Let the following two languages over the alphabet E= {a,b} be given: L = {ababka | k No} L2= {abkbka | ke No} Both languages are context free, but only one of them is regular. (a) Which of the two languages is regular? Show the regularity of that language by giving an ap- propriate language generator or language acceptor (for example a DFA, NFA, regular expression or regular grammar). (b) Which of the two languages is not regular? 1) Show that this language is context free by giving an appropriate language generator or language acceptor (for example a context free grammar or a pushdown automaton). 2) Show that the language is not regular. You may use either the Pumping Lemma or the Myhill-Nerode Theorem.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!