Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
DFA minimization
open-in-new
<p>In <a href="/facts/Automata_theory/Q6BmPv63">automata theory</a> (a branch of <a href="/facts/Theoretical_computer_science/jSkGGuvy">theoretical computer science</a>), DFA minimization is the task of transforming a given <a href="/facts/Deterministic_finite_automaton/9conRLFS">deterministic finite automaton</a> (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same <a href="/facts/Regular_language/ahxw67T1">regular language</a>. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory. </p>