Time Left - 15:00 mins
GATE 2024 Theory of computation Foundation Quiz 91
Attempt now to get your rank among 40 students!
Question 1
When does a PDA behaves like a Turing machine ?
Question 2Multiple Correct Options
A turing machine is restricted as following:
I. Head can only read and no writing capability.
II. Head can move only one direction
(undirectional )
Which of the following machine is not equivalent to above restricted turing machine.[multiselect question]
I. Head can only read and no writing capability.
II. Head can move only one direction
(undirectional )
Which of the following machine is not equivalent to above restricted turing machine.[multiselect question]
Question 3
Consider the following statements about a TM that accepts a language L.
S1: If the string in the language L, then TM halts in final state.
S2: If the string not in the language L, then TM may halt in non-final state or never halt.
If the string given as an input to the TM, then which of the above statements are correct?
Question 4
If Turing Machine head restricted to move in only right direction, then what is the language accepted by turing machine?
Question 5Multiple Correct Options
Consider the following transition table of a Turing machine and statements regarding it.
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.
The statements that are correct is?
- 40 attempts
- 0 upvotes
- 0 comments
Jun 11GATE & PSU CS
