Theory of Computation - Old Questions
10. State and prove the pumping lemma for regular language. Explain about its application.
8 marks
|
Asked in 2076