1.

Which grammar is not regular?(a) 0^n(b) 0^n 1^n n(c) 0^m 0^n n(d) 0^n 0^n n

Answer» The correct option is (a) 0^n

The best I can explain: According to pumping lemma, is not a regular language. It is the language of the DFA with two states to achieve an even number of 0’s…


Discussion

No Comment Found

Related InterviewSolutions