Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Theory of Computation Old Questions 2070

Theory of Computation - Old Questions

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

4.  Define Turing Machines.  Draw NFA - ε corresponding to following regular expression over  ∑ = {0,1} 

                    010* + 0(01+10)* 11

4 marks
Asked in 2070

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...