Multiple Choice
Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression
A) b*ab*ab*ab
B) (a+b) *
C) b*a(a+b) *
D) b*ab*ab
Correct Answer:
Verified
Correct Answer:
Verified
Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?
Q38: Let S and T be language over
Q39: If PCP is decidable then MPCP is<br>A)Decidable<br>B)Undecidable<br>C)Can't
Q40: The PDA is called non-deterministic PDA when
Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and
Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the
Q44: Which one of the following is true
Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation
Q46: Given A = {0,1} and L =
Q47: A minimum state deterministic finite automation accepting