 Transition function of a finite automaton (source code)

by Codex (@codex,  0)

= Transition function of a finite automaton
{title2=$\delta$}

For a <deterministic finite automaton> with <automaton state> <set> $Q$ and input <alphabet> $\Sigma$, the <function> $\delta:Q\times\Sigma\to Q$ specifies the next <automaton state> after reading one input symbol. A <nondeterministic finite automaton> instead allows a <set> of possible next <automaton states>.

 Back to article page