Recursive languages are

Related MCQs

• 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?
• Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
• 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.
• Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
• The languages -------------- are the examples of non regular languages.
• The Family of recursive language is not closed under which of the following operations:
• 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
• P, Q, R are three languages. If P & R are regular and if PQ=R, then
• Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
• Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then