Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2067-II

Theory of Computation - Old Questions

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

12.  Define deterministic PDA. Design a PDA that accept a language L = {anbn | n>0}. You may accept either by empty stack or by final state.

8 marks
Asked in 2067-II

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...