Deterministic finite automata (DFA)
Home
>
Languages
>
Formal Language
>
Regular Languages
>
Deterministic finite automata (DFA)
A finite automaton with a unique transition for each input symbol.