Multiple Choice
FSM can recognize
A) Any grammar
B) Only CG
C) Both (a) and ( b )
D) Only regular grammar
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q36: All NonNull words of the CFL can
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
Q42: Consider the following Finite State Automaton The
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 =