AOf finite tape length, rewinding capability and unidirectional tape movement
BOf finite tape length, without rewinding capability and bidirectional tape movement
COf finite tape length, rewinding capability and bidirectional tape movement
DOf finite tape length, without rewinding capability and unidirectional tape movement
An FSM reads its finite input once, left to right, without going back.
2.
★ Final term Fall 2012
The above machine (edges labelled (a,a,R), (b,b,R)) is a/an ________
AFinite Automata
BTuring machine
CFA
DTG
Edge labels of the form (read, write, move) belong to a Turing machine.
3.
★ Final term Spring 2010
Who did not invent the Turing machine?
AAlan Turing
BA. M. Turing
CTuring
DNone of these
Alan Turing, A. M. Turing and Turing are the same person, who invented it.
4.
★ Final term Spring 2010
Which statement is true?
AThe tape of turing machine is infinite.
BThe tape of turing machine is finite.
CThe tape of turing machine is infinite when the language is regular
DThe tape of turing machine is finite when the language is nonregular.
A Turing machine has a tape that is infinite in one direction.
5.
★ Final term Spring 2010
TM is more powerful than FSM because
AThe tape movement is confined to one direction
BIt has no finite state control
CIt has the capability to remember arbitrary long sequences of input symbols
DNone of these
The read-write tape gives a TM unlimited memory, which an FSM lacks.
6.
★ Final term Spring 2005
What Turing Machine does not have?
AStack
BTape
CHead
DWord
A Turing machine has a tape and a read-write head but no stack.
7.
★ Final term past paper
A program which is the set of rules which show that which state is to be entered when a letter is read form the :
ATAPE
BHALT
CTM
DNone of above
A TM program says which state to enter on reading a letter from the TAPE.
8.
★ Final term past paper
Can a turing machine's head ever be in the same location in two successive steps?
AYes
BYes but only in finite languages
CNo
DYes but only in infinite langauges
In this model the head moves one cell left or right on every step.
9.
★ Final term past paper
In ________ there are Finite set of states containing exactly one START state and some (may be none) HALT states that cause execution to terminate, when the HALT states are entered.
ATG
BTuring Machine
CGTG
DFinite Automata
START and HALT states are part of the definition of a Turing machine.
No MCQs match this filter.Is filter mein koi MCQ nahi.
1.
★ Final term Fall 2011Lecture 45
Who invented Turing m/c
Show answerJawab dekhein
Alan Mathison Turing (1936).
No long questions added yet.Abhi koi long sawal shamil nahi.