Scribd
Upload
34 views84 pages

Turing Machine

The document discusses various aspects of Turing machines, including their operation, types, and the languages they can recognize. It covers concepts such as recursive languages, decidability, and the differences between single-tape and multi-tape Turing machines. Additionally, it addresses the classification of problems as decidable or undecidable based on the existence of algorithms.

Uploaded by

baliyand8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views84 pages

Turing Machine

The document discusses various aspects of Turing machines, including their operation, types, and the languages they can recognize. It covers concepts such as recursive languages, decidability, and the differences between single-tape and multi-tape Turing machines. Additionally, it addresses the classification of problems as decidable or undecidable based on the existence of algorithms.

Uploaded by

baliyand8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 84

Turing Machine

A turing machine operates over:


a) finite memory tape
b) infinite memory tape
c) depends on the algorithm
d) none of the mentioned
• Which of the functions are not performed by
the turing machine after reading a symbol?
a) writes the symbol
b) moves the tape one cell left/right
c) proceeds with next instruction or halts
d) none of the mentioned
• Turing machine can be represented using the
following tools:
a) Transition graph
b) Transition table
c) Queue and Input tape
d) All of the mentioned
If L is a recursive language, L’ is:
a) Recursive
b) Recursively Ennumerable
c) Both (a) and (b)
d) None of the mentioned
d(q,X)=(r,Y,D) where D cannot be:
a) L
b) R
c) S
d) None of the mentioned
• In one move a turing machine will:
a) Change a state
b) Write a tape symbol in the cell scanned
c) Move the tape head left or right
d) All of the mentioned
• X is a simple mathematical model of a
computer. X has unrestricted and unlimited
memory. X is a FA with R/W head. X can have
an infinite tape divided into cells, each cell
holding one symbol.
Name X?
a) Push Down Automata
b) Non deterministic Finite Automata
c) Turing machines
d) None of the mentioned
• The machine accept the string by entering
into hA or it can:
a) explicitly reject x by entering into hR
b) enter into an infinte loop
c) Both (a) and (b)
d) None of the mentioned
• X is a simple mathematical model of a
computer. X has unrestricted and unlimited
memory. X is a FA with R/W head. X can have
an infinite tape divided into cells, each cell
holding one symbol.
Name X?
a) Push Down Automata
b) Non deterministic Finite Automata
c) Turing machines
d) None of the mentioned
• A turing machine with several tapes in known
as:
a) Multi-tape turing machine
b) Poly-tape turing maching
c) Universal turing machine
d) All of the mentioned
• A multitape turing machine is ________
powerful than a single tape turing machine.
a) more
b) less
c) equal
d) none of the mentioned
• Every language accepted by a k-tape TM is
_____ by a single-tape TM.
a) accepted
b) not accepted
c) generated
d) not generated
• A deterministic turing machine is:
a) ambiguous turing machine
b) unambiguous turing machine
c) non-deterministic
d) none of the mentioned
• CSG can be recognized by

a. push down automata


b. 2-way linear bounded automata
c. finite state automata
d. None of these
• Answer: (b).2-way linear bounded automata
• A formal language is recursive if :
a) a total turing machine exists
b) a turing machine that halts for every input
c) turing machine rejects if the input does not
belong to the language
d) all of the mentioned
• Answer: d
Explanation: A formal language is called
recursive if it is a recursive subset of the set of
all possible finite sequences over the
alphabet of the language.
• Recursive languages are also known as:
a) decidable
b) undecidable
c) sometimes decidable
d) none of the mentioned
• Answer: a
Explanation: A language is recursive if there
exists a turing machine such that it halts i.e.
accepts if the input belongs to the language
else rejects. It is better called Turing
decidable language.
• The decision problem is the function from
string to ______________
a) char
b) int
c) boolean
d) none of the mentioned
• A language L is said to be ____________ if
there is a turing machine M such that L(M)=L
and M halts at every point.
a) Turing acceptable
b) decidable
c) undecidable
d) none of the mentioned
• Answer: b
Explanation: Decidability refers to the
decision problem and existence of a effective
method for determining membership, and
return true and false accordingly rather that
going into a loop forever.
• The problems which have no algorithm,
regardless of whether or not they are
accepted by a turing machine that fails to
halts on some input are referred as:
a) Decidable
b) Undecidable
c) Computable
d) None of the mentioned
• Answer: b
Explanation: The problems that can be solved
by a turing machine can divided into two
classes:
a) Those that have an algorithm
b) Intractable problems: Those that are only
solved by a turing machine that may run
forever on inputs they do not accept.
• A problem is called __________ if its has an
efficient algorithm for itself.
a) tractable
b) intractable
c) computational
d) none of the mentioned

You might also like