Semester : SEMESTER 5
Subject : Theory of Computation
Year : 2019
Term : MAY
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 301
Page:3
19 a)
20 a)
E1107
120.
What is Multi-tape Turing Machine?
Design a Turing machine that accepts the language 100" where n>0.
What is a non-deterministic Turing Machine? Give an example.
What is a Turing machine? Give the specification of a Turing
machine and explain.
What is recursive and recursively enumerable languages
ಸಸ್ಯ KR
Page 3 of 3
(5)
(5)
(5)
(5)
(5)
Pages: 3