Theory of Computation - Old Questions
5. State the pumping lemma for regular language. Show by example, how can you use it to prove that a language is not regular.
4 marks
|
Asked in 2072