Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2071

Theory of Computation - Old Questions

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

10.  Prove that for any given NFA N accepting a language L there exists a DFA D such that L(N) = L(D). 

8 marks
Asked in 2071

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...