other names · Added 10 October 2026
DFA minimization
Task of transforming a deterministic finite automaton
In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.
From Wikipedia (CC BY-SA). Not a dictionary word, so it lives in Other Names.
Read more about DFA minimization on Wikipedia → or look up a word above