How is it possible to set a turing machine in infinite loop by putting a string that doesn't belong to input language even if it has a reject state?
Asked
Active
Viewed 95 times
1
-
2I'm voting to close this question as off-topic because it is not a programming problem. It is a question about the theory of computation. If you have a programming problem, please show the code that is not working. – Raymond Chen Mar 19 '17 at 15:23
-
@RaymondChen - I agree – JoeG Mar 19 '17 at 15:39
-
@RaymondChen That's OK. But where do I post this question ? – krhitesh Mar 19 '17 at 15:44
1 Answers
1
Consider the TM that does the following:
- Read a tape cell. If 0, halt accept. If 1, write 1, move right, and enter state 2.
- Read a tape cell. If 0, halt reject If 1, write 1, move left, and enter state 1.
This machine accepts strings 0* + 10*. It does not accept anything in 11* but it will loop forever on such a string.
Patrick87
- 27,682
- 3
- 38
- 73