Course Content

Other Courses

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

Theory of Computation - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

6.  Construct a Turning Machine that accepts a language of strings over (a, b) with each string of even length. Show how it accepts string abab.

4 marks | Asked in 2067-II