Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2069

Theory of Computation - Old Questions

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

11.  Define the non-deterministic finite automata (NFA) and write down recursive definition of for NFA.

8 marks
Asked in 2069

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...