Automaton state
= Automaton state
{title2=$q\in Q$}
An <automaton state> is one possible memory configuration of a <finite-state machine>. The initial <automaton state> is the starting configuration; accepting <automaton states> indicate successful recognition when the whole <word> has been read.