Theory of Computation - Old Questions
10. State and prove pumping lemma for regular language. Show by example how it can be used to prove a language is not a regular.
8 marks
|
Asked in 2067-II