COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
It cannot remember arbitrarily large amount of information
|
|
|
It cannot remember state transitions
|
|
|
It cannot remember grammar for a language
|
|
|
It cannot remember language generated from a grammar
|
Detailed explanation-1: -What are the basic limitations of finite state machine? Explanation: Because it does to store its previous state of the transition. Explanation: Palindromes cannot be recognized by FSM.
Detailed explanation-2: -1 Answer. 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-3: -FA can only count finite input. There is no finite auto ma that can find and recognize set of binary string of equal Os & 1s. Set of strings over “(” and “)” & have balanced parenthesis.
Detailed explanation-4: -The transition function defines the movement of an automaton from one state to another by treating the current state and current input symbol as an ordered pair. For each pair of “current state” and “current input symbol” (the function input), the transition function produces as output the next state in the automaton.
Detailed explanation-5: -FSM doesn’t have memory, It can’t remember the things unlike Push Down Automata (i.e nothing but a FSM with Memory). Anything which require memory can’t accepted by FSM.