COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
May change its state
|
|
|
Write a symbol on the cell being scanned
|
|
|
Move the head one position left or right
|
|
|
All of the above
|
|
|
None of these
|
Detailed explanation-1: -In one move a turing machine will:a)Change a stateb)Write a tape symbol in the cell scannedc)Move the tape head left or rightd)All of the mentionedCorrect answer is option ‘D’.
Detailed explanation-2: -A move of a Turing machine (TM) is a func-tion of the state of the finite control and the tape symbol just scanned. In one move, the Turing machine will: 1. Change state.
Detailed explanation-3: -2. Turing machine consist of: (A) Input tape (B) Blank symbol (C) Tape head (D) All of these Ans: d Explanation: TM consist of number of states, input alphabet, tape head, blank symbol, 3.
Detailed explanation-4: -The Turing machine can move back and forth along this tape, reading and writing symbols and changing state. It can read only one cell at a time, and possibly write a new value in that cell. After doing this, it can change state and it can move by one cell either to the left or to the right.
Detailed explanation-5: -9. Which of the following is true about Turing’s a-machine? Explanation: Turings a-machine or automatic machine was left ended, right end infinite.