Theory of Computation (Automata)
What does Finite automaton refer to?
- A. A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.
- B. An abstract machine with a finite number of states used to recognize patterns in input strings. ✓
- C. A finite automaton where each state has exactly one transition for each possible input symbol.
- D. A language that can be expressed using a regular expression or recognized by a finite automaton.
Correct answer
B. An abstract machine with a finite number of states used to recognize patterns in input strings.
Explanation
Finite automaton refers to an abstract machine with a finite number of states used to recognize patterns in input strings.