Multiple Choice
Basic limitation of FSM is that it
A) Cannot remember arbitrary large amount of information
B) Sometimes fails to recognize grammars that are regular
C) Sometimes recognizes grammars are not regular
D) None of these
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: Consider a language L for which there
Q3: The concept of FSA is much used
Q4: The Family of recursive language is not
Q5: Recursive languages are<br>A)A proper superset of CFL<br>B)Always
Q6: The logic of pumping lemma is a
Q7: Let L be a language defined over
Q8: Which of the following statements is wrong?<br>A)The
Q9: Fred created a new automaton model which
Q10: If a language is denoted by a
Q11: Grammar that produce more than one Parse