Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Theory of Computation Old Questions 2076

Theory of Computation - Old Questions

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

13.  Define PDA. Explain how a PDA accepting by empty stack is converted into equivalent PDA accepting same language by final state.

8 marks
Asked in 2076

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...