What are the basic limitations of finite state machine?
(a) It cannot remember arbitrarily large amount of information
(b) In cannot remember state transitions
(c) In cannot remember grammar for a language
(d) It cannot remember language generated from a grammar
This question was addressed to me during an interview.
The query is from Finite Automata topic in division Finite Automata and Regular Expression of Compiler