home

Deterministic Finite Automata

Deterministic Finite Automata (DFA) are a type of Finite automata where for each state there is exactly one transition for each symbol of the alphabet, and there is a unique starting state.

If these conditions are not met, it is a Nondeterministic Finite Automaton.