COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
writes the replacement symbol
|
|
|
moves the tape one cell left/right
|
|
|
proceeds with next instruction or halts
|
|
|
clears the current tape cell
|
Detailed explanation-1: -A state register stores the state of the Turing machine. After reading an input symbol, it is replaced with another symbol, its internal state is changed, and it moves from one cell to the right or left.
Detailed explanation-2: –A transition rule of a Turing machine has the following form (p, X)=(q, Y, L). This means that from state p, on reading the symbol X on the tape, the machine moves to state q, replaces X with Y and moves the tape head to the left.
Detailed explanation-3: -3. Which of the functions are not performed by the turing machine after reading a symbol? c) proceeds with subsequent instruction or goes either into accepting halting state or rejecting halting state. Explanation: The turing machine was invented by Alan turing in 1936.
Detailed explanation-4: -When a Turing machine enters a final state it will stop. If the final state it entered is an accepting state, the machine will accept its original input. If the final state is a rejecting state, the machine rejects its input.