Recursively enumerable languages are not closed under ______________ – McqOptions

MCQOPTIONS

1.	Recursively enumerable languages are not closed under ______________
A.	Union
B.	Intersection
C.	Complementation
D.	Concatenation
Answer» D. Concatenation

Discussion

No Comment Found

Related MCQs

Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?
Which of the following language accepted by a Push down Automata?
Grammars that can be translated to DFAs is ___________
Automaton accepting the regular expression of any number of a’ s is ___________
Grammar that produce more than one Parse tree for same sentence is ___________
Recursively enumerable languages are not closed under ______________
Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (*,*) in the operator precedence table constructed for the grammar.
If P & R are regular and also given that if PQ=R, then?
Assume the statements S1 and S2 given as:S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.S2: There exists an algorithm to determine whether two context free grammars generate the same language.Which of the following is true?