Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Theory of Computation Old Questions 2076 (new)

Theory of Computation - Old Questions

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

2.  How can you define the language accepted by a PDA? Explain how a PDA accepting language by empty stack is converted into an equivalent PDA accepting by final state and vice-versa.    (2+4+4)

10 marks
Asked in 2076 (new)

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...