A random access machine (RAM) and truing machine are different in

Related MCQs

• Which is correct regard an off-line Truing machine?
• 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.
• 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?
• In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”
• 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
• 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
• The number of symbols necessary to simulate a Turing machine with m symbols and n states
• Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then