Automaton A2 is the simplest automaton, with a single accepting state. Or, it should
be, except that it is unrealizable as drawn. The intent of the automaton, as shown
in the input examples, is that it accepts all single-character strings `1` and `0`.
This requires a second state that transitions to the drawn state on all inputs.
This error was not realized until this automaton was synthesized for the first time,
illustrating the importance of providing input examples for a sanity check. However,
our use of program synthesis lets us simply add an additional "extra" state to the
program specification, which generates the intended automaton program.