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

Related MCQs

• 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
• If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
• Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
• He difference between a read-only Turing machine and a two-way finite state machine is
• What is the reason behind a Turing machine is more powerful than finite state machine FSM?
• 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?
• The number of symbols necessary to simulate a Turing machine with m symbols and n states
• Which of the following statement is false for a turing machine?
• A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.