Course Content

Other Courses

Tribhuvan university > CSIT - 2065 Syllabus > Theory of Computation > Old Questions > 2068

Theory of Computation - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

12.  Define the language of PDA that accepts by Final state. Explain, how a PDA accepting by empty stack can be converted into a PDA final state.

8 marks | Asked in 2068