Which of the following is an application of Finite Automaton?
(a) Compiler Design
(b) Grammar Parsers
(c) Text Search
(d) All of the mentioned
This question was addressed to me in homework.
Question is taken from Equivalence of NFA and DFA in portion Finite Automata of Automata Theory