Академический Документы
Профессиональный Документы
Культура Документы
UNIT – I
PART-A
2.What are the difference between finite automata and Turing Machines?Turing machine can change
symbols on its tape, whereas the FA cannot change symbols on tape. Also TM has a tape head that
moves both left and right side, whereas the FA doesn’t have such a tape head.
4. What is configuration?
Turing machine computes, changes occur in the current state, the current tape contents and
the current head location.a setting of these three items is called a configuration.
www.annauniversityplus.com
9.What is an algorithm?
An algorithm is a collection of simple instruction for carrying out some task. It is sometimes called
procedures or recipes.
10.What is a polynomial?
It is a sum of terms where each term is a product of certain variables and a constant called a co-
efficient.
Eg.6 x*x*x*y*z*z=6x3yz2
19.What is a correspondence?
A function that is both one-to-one and onto is called correspond.
PART-B
1. Explain the various techniques for Turing machine construction.
www.annauniversityplus.com
2. Briefly explain the different types of Turing machines.
3. Design a TM to accept the language L={0n1n | n>=1}
4. Explain how a TM can be used to determine the given number is prime or not.
5. Prove that if L is recognized by a TM with a two way infinite tape if it is recognized by a TM
with a one way infinite tape.
6. Prove that Halting problem is undecidable.
7. Design a Turing machine that accepts the language L={an bn cn /n>1}
8. What are the various models of Turing Machine?
9. With an example explain the universal Turing machine
10. Show that halting problem of Turing machine is undecidable.
11. Show that a language is decidable if it is Turing-recognizable and co- recognizable
www.annauniversityplus.com