LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
It can’t remember arbitrary large amount of information
|
|
|
It sometimes recognize grammar that are not regular
|
|
|
It sometimes fails to recognize regular grammar.
|
|
|
All of the mentioned
|
Detailed explanation-1: -a) It can’t remember arbitrary large amount of information. b) It sometimes recognize grammar that are not regular. c) It sometimes fails to recognize regular grammar. Explanation:Because there is no memory associated with automata.
Detailed explanation-2: -Limitations of Finite Automata The defining characteristic of FA is that they have only a finite number of states. Hence, a finite automata can only “count” (that is, maintain a counter, where different states correspond to different values of the counter) a finite number of input scenarios.
Detailed explanation-3: -The correct choice is (a) It can’t remember arbitrary large amount of information. The explanation: Because there is no memory associated with automata.
Detailed explanation-4: -Memory in finite automata is present in the form of states Q only and according to automata principal: any automata can have only finite set of states. hence finite automata has finite memory, this is the reason automata for regular language is called finite automata.
Detailed explanation-5: -A finite automaton has no memory other than which state is the current state. The strings in the language consist of some substring, then another substring, then the reverse of the first substring.