Match List I with List II:LR: Regular language, LCF: Context free languageLREC: Recursive language, LRE: Recursively enumerable language.List IList II(A) Recursively Enumerable language(I) L̅REC ∪ LRE(B) Recursive language(II) L̅CF ∪ LREC(C) Context Free language(III) LR ∩ LCF Choose the correct answer from the options given below:

Match List I with List II:LR: Regular language, LCF: Context free lang

1.	Match List I with List II:LR: Regular language, LCF: Context free languageLREC: Recursive language, LRE: Recursively enumerable language.List IList II(A) Recursively Enumerable language(I) L̅REC ∪ LRE(B) Recursive language(II) L̅CF ∪ LREC(C) Context Free language(III) LR ∩ LCF Choose the correct answer from the options given below:
A.	A - II, B - III, C - I
B.	A - III, B - I, C - II
C.	A - I, B - II, C - III
D.	A - II, B - I, C - III
Answer» D. A - II, B - I, C - III

Discussion

No Comment Found

Related MCQs

Let L={w∈(0+1)∗∣w has even number of 1's}, i.e. L is the set of all bit strings with even number of 1's. Which one of the regular expression below represents L?
If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?
In some programming languages, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denotes the set of letters and digit respectively. Which of the following expression defines an identifier?
Let be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?
Number of states in DFA accepting the following language is:L = { an b2m | n, m ≥ 1 }
Consider the following two statements:I. If all states of an NFA are accepting states then the language accepted by the NFA is ∑*.II. There exists a regular language A such that for all languages B, A ∩ B is regular.Which one of the following is CORRECT?
Consider the DFA A given belowWhich of the following are FALSE?1. Complement of L(A) is context-free.2. L(A) = L((11*0 + 0)(0 + 1)*0*1*)3. For the language accepted by A, A is the minimal DFA.4. A accepts all strings over {0, 1} of length at least 2.
Consider the finite automaton in the following figure.What is the set of reachable states for the input string 0011?
Definition of a language L with alphabet {a} is given as follows:\(L= a^{nk} | k >0 \) and n is a positive integer constant. What is the minimum number of states needed in a DFA to recognize L?
Consider the following statements.I. If L1 ∪ L2 is regular, then both L1 and L2 must be regular.II. The class of regular languages is closed under infinite union.Which of the above statements is/are TRUE?

Discussion

No Comment Found

Related MCQs

Reply to Comment