edited by
979 views

2 Answers

1 votes
1 votes

The Turing machine uses its transition function to map the current state and current symbol to the following: the next state, the next symbol and the movement for the tape head. If the transition function is not defined for the current state and current symbol, then the Turing machine crashes.

Halt and crash condition of Turing machine

A turing machine is said to be in halt state  if it is not able to move further.The set of  string followed from initial state to halt state is the language accepted by a Turing machine. The halt state in a turing machine is almost similar to a final state in a finite automata or push down automata with the only difference that when a turing machine enters into a halt state it does not take any further move.

If the read/write head of a turing machine is over the left most cell  and the machine is asked to take a left move it is called crash condition. Similarly, if the read/write head of the turing machine is over the right most cell  and the machine is asked to take a right move then it is also called a crash condition.

 

edited by
0 votes
0 votes

A) No problem if it didn't traverse some state.

B)Till input remains it traverse state at end it stop at some state and we can decide accordingly, No, problem in that.

C)IF transition function is not defined how would machine traverse? i.e it crashes.

Ans- C

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Mar 2, 2018
295 views
The total number of words represented by the regular expression (^ + a + b) (^ + a + b) (^ + a + b) is815169
1 votes
1 votes
1 answer
3
0 votes
0 votes
2 answers
4
gatecse asked Mar 2, 2018
737 views
Bluetooth uses ____ method in physical layer to avoid interference from other devices or other networksFHSSFDSSTDSNone of the above