Theory of Computation MCQs | Page - 9

Q. 81) The language L = {anbnan n≥ 1} is recognized by

Q. 82) 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

Q. 83) If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

Q. 84) Universal Turing machine (UTM) influenced the concepts of

Q. 85) The number of symbols necessary to simulate a Turing machine with m symbols and n states

Q. 86) A universal Turing machine is a

Q. 87) He difference between a read-only Turing machine and a two-way finite state machine is

Q. 88) Which is correct regard an off-line Truing machine?

Q. 89) Which of the following statement is wrong?

Q. 90) Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;