Theory of Computation (Automata)
Identify the correct concept described as: the process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
- A. DFA minimization ✓
- B. Kleene star
- C. Formal language
- D. Epsilon transition
Correct answer
A. DFA minimization
Explanation
DFA minimization refers to the process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.