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
Q36: For two regular languages L1 = (a
Q37: Pumping lemma is generally used for proving
Q38: What is the highest type number which
Q39: Following syntax-directed translation scheme is used with
Q40: FSM can recognize
A)Any grammar
B)Only CG
C)Both (a) and
Q42: Which of the following are decidable?
1) Whether
Q43: If L and L¯ are recursively enumerable,
Q44: Which of the following problems is undecidable?
A)Membership
Q45: Fred created a new automaton model which
Q46: Which of the following statements is/are FALSE?
(1)
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents