UNIT 5: TURING MACHINE (TM)

1. What is Turing Machine. Give definition of Turing Machine.

2. Write advantages of TM over FSM.
3. What do you mean by an instantaneous description of a Turing Machine?
4. Draw a Turing Machine(TM) to accept Even and odd Palindromes over {a,b}.
5. Explain Universal Turing machine with the help of an example
6. Write a Turing Machine to copy strings.
7. Describe recursive languages and recursively enumerable languages.
8. Design a Turing machine to accept the language {0n1n | n ≥ 1}.
9. Design a Turing machine for the language over {0,1} containing strings with equal
number of 0’s and 1’s.
10. Draw a transition diagram for a Turing machine accepting the following language.
{ an bn cn | n ≥ 0 }
11. Draw the TM which recognize words of the form { an bn cn | n>=1}.
12. Explain Church Turing Hypothesis.
13. Define grammar and Chomsky hierarchy.
14. Draw a transition diagram for a Turing machine for the language of all
palindromes over {a, b}.
15. Write a short note on Church-Turing thesis.

**********