Library

QA · Recursively enumerable

enqueue then match

The textbook Queue Automaton example.

q0q1acc
The machine as drawn — 3 states, 2 transitions.