Virtual GATE 2015 - Question 35

Given Answer Key: A
Discuss the solution.

karn @karn
29 Jan 2015 02:28 pm

I had seen some were, there is mantion that all RL satisfied the pumping lemma. tell me pls i m right or wrong.


Mv Prasad @mvprasad
29 Jan 2015 04:07 pm
According to my hill before theorem if number of equivalence classes are finite then it is regular.
Pumping lemma tell a non regular language is non regular