Вы находитесь на странице: 1из 3

THEORY OF COMPUTATION TWO MARKS QUESTION

WITH ANSWER UNIT I

UNIT – I

PART-A

1. What is a Turing Machine?


Turing machine is a simple mathematical model of a computer. TM has unlimited an unrestricted
memory and is a much more accurate model of a general purpose computer. The turing machine is a
FA with a R/W Head. It has an infinite tape divided into cells ,each cell holding one symbol.

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.

3. Define Turing Machine?


A turing machine is a 7-tuple (Q, Σ, Γ, δ, q0, qaccept, qreject) where
Q: finite set of states
Σ: input alphabet (cannot include blank symbol, _)
Γ: tape alphabet, includes Σ and _
δ: transition function: Q × Γ → Q × Γ × {L, R}
q0: start state, q0 ∈ Q
qaccept: accepting state, qaccept ∈ Q
qreject: rejecting state, qreject ∈ Q

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.

5. What is a recursively enumerable language?


The languages that is accepted by TM is said to be recursively enumerable (r. e ) languages.
Enumerable means that the strings in the language can be enumerated by the TM. The class of r. e
languages include CFL’s.

6. Define variants of Turing Machine?


Variants are Non deterministic turing machine. Mutlitape turing machine. Enumerators

7. What is a multitape TM?


A multi-tape Turing machine consists of a finite control with k-tape heads and ktapes each tape is
infinite in both directions. On a single move depending on the state of finite control and symbol
scanned by each of tape heads ,the machine can change state print a new symbol on each cells
scanned by tape head, move each of its tape head independently one cell to the left or right or remain
stationary.

8. Define nondeterministic TM?


• Arbitrarily chooses move when more than one possibility exists
• Accepts if there is at least one computation that terminates in an accepting state

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

11. Define Church-Turing thesis?


In 1936 Alonzo church used a notational system called λ-calculus to define algorithms and
Alan Turing did it with his “machines”. These two definitions were shown to be equivalent .This
connection between the informal notion and precise definition has come to be called Church-Turing
thesis

12. List the types of description.


Formal description. Implementation description. High-level description.

13.What is halting problem?


A {M,w | TM M is a TM and M accepts w }

TM A is undecidable but TM A is Turing – recognizable hence TM A is sometimes called the halting


problem.
.
14.Define universal Turing machine.
A universal Turing machine (UTM) is a TM which is capable of simulating any other Turing machine
from the description of the machine.

15. What is a Diagonalization language Ld?


The diagonalization language consists of all strings w such that the TM whose code is w does not
accept when w is given as input.

16.Why some languages are not decidable or even Turing – recognizable?


The reason that there are uncountable many languages yet only countably many Turing
machines. Because each Turing machine can recognize a single language and there are more
languages than Turing machines, some languages are not recognizable by any Turing machine.

17. What do you mean by co-Turing-recognizable?


A language is called co-Turing-recognizable if it is the complement of a Turing- recognizable
language

18. Define Countable and Uncountable?


• A set is countable if it is finite or has the same size as N (the set of natural numbers {1, 2, 3, …})
– Examples: N (natural numbers), Z (integers), Q (rational numbers), E (even numbers), etc.
• A set is uncountable if it has more elements than N .
– Examples: R (real numbers) ⊃ [0,1] ⊃ Cantor set

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

Вам также может понравиться