Theory of Computation
Unit 5
TURING MACHINES
- Draw and explain turing machine model.
- State the techniques for turing machine construction. Explain each of them.
- What is halting problem? Explain the two cases.
- If L ={anbn, where n≥1}, Construct turing machine to recognize L(R).
- Construct turing machine for L ={anbnan , n≥1}.
- Construct turing machine for 2’s complement of binary number.
- Construct turing machine for n2.
- Write a TM for making a copy of string that consists of {a,b}.
- Write short note on: Halting problem.
- Write short note on: Church’s turing hypothesis.
0 matching results found