Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2073

Theory of Computation - Old Questions

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

13.  Discuss the equivalent of PDA and CFG. Convert the grammar

           S→aAA

           A→aS|bS|a

        to a PDA that accepts the same language by empty stack.

8 marks
Asked in 2073

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...