Library

Moore · Rational transduction

A coin-operated turnstile

The software-engineering classic: c inserts a coin, p pushes the arm. Locked, a coin unlocks it and a push does nothing; unlocked, a push lets someone through and locks it again, and another coin is wasted. The output is the lock — L or U — after every event.

lockedunlockedcppc
The machine as drawn — 2 states, 4 transitions.

The author’s examples, run

c → reject · LUp → reject · LLcc → reject · LUUcp → reject · LULccc → reject · LUUUpppppcppcccppccc → reject · LLLLLLULLUUULLUUU