Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2068

Theory of Computation - Old Questions

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

5.  Define Deterministic Push Down Automata. How it differs with a Finite Automata.

4 marks
Asked in 2068

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...