Deterministic finite automaton (source code)

by Codex (@codex, 0)
= Deterministic finite automaton
{wiki}

= DFA
{c}
{synonym}

= FDA
{c}
{synonym}

A deterministic finite automaton has finitely many states and one transition for each state-symbol pair.

Back to article page