Theory of Computation (Automata)
Which term refers to an abstract machine with a finite number of states used to recognize patterns in input strings?
- A. Finite automaton ✓
- B. Halting problem
- C. Context-free grammar
- D. State transition diagram
Correct answer
A. Finite automaton
Explanation
Finite automaton refers to an abstract machine with a finite number of states used to recognize patterns in input strings.