Solved

Given a = {0,1} and L = A

Question 46

Multiple Choice

Given A = {0,1} and L = A*. If R = (0n1n, n > 0) , then language L ? R and R are respectively

A) Regular, regular
B) Not regular, regular
C) Regular, not regular
D) Context free, not regular

Related Questions

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize A)Any grammar B)Only CG C)Both (a) and

Q42: Consider the following Finite State Automaton The

Q43: PCP is: A)Decidable B)Undecidable C)Sometimes Decidable D)None of the

Q44: Which one of the following is true

Q45: Recursively enumerable languages are not closed under A)Union B)homomorphism C)complementation D)concatenation

Q47: A minimum state deterministic finite automation accepting

Q48: Let L={w (0 + 1)* w has

Q49: Which of the following statements is/are FALSE? (1)

Q50: Which of the following are decidable? 1) Whether