McqMate

Q. |
## Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct? |

A. | X is decidable |

B. | X is undecidable but partially decidable |

C. | X is undecidable and not even partially decidable |

D. | X is not a decision problem |

Answer» A. X is decidable |

2.7k

0

Do you find this helpful?

12

View all MCQs in

Theory of ComputationNo comments yet

- Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
- Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
- Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.
- Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is
- He difference between a read-only Turing machine and a two-way finite state machine is
- State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be
- What is the reason behind a Turing machine is more powerful than finite state machine FSM?
- If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
- If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
- Which of the following statement is false for a turing machine?