Library

Moore · Rational transduction

A traffic light with a pedestrian button

Each t is a tick of the controller’s clock and p a press of the crossing button. The light stays green until someone presses, then goes yellow and red on the next ticks and returns to green. The press is remembered in the state — a green light with a request waiting is a different state from a plain green one, even though both show G.

GGpYRtptptptp
The machine as drawn — 4 states, 8 transitions.

The author’s examples, run

p → reject · GGt → reject · GGpp → reject · GGGpt → reject · GGYppp → reject · GGGGttpptttpppppttpp → reject · GGGGGYRGGGGGGYRRR