Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2067

Theory of Computation - Old Questions

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

1. Define finite Automata with ɛ moves.Is ɛ NFA has more computation power than DFA?

4 marks
Asked in 2067

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...