Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2072

Theory of Computation - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

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

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...