GATE 2022: Theory Of Computation Quiz-7
Attempt now to get your rank among 292 students!
1) A turing machine is more powerful than finite state machine because it has no finite state
2) A finite state machine can be assumed to be a turing machine of finite tape length without rewinding capability and unidirectional tape movement.
Which one of the above statements holds true?
Statement 1- the Given Turing machine is a non-halting Turing machine.
Statement 2- the Given Turing machine is halting Turing machine.
Statement 3- Language accepted by the above Turing machine is a type of languages that is closed under intersection operation.
Number of statements that are correct is ____.
- 292 attempts
- 0 upvotes
- 1 comment