Lemma 2.2

Lemma 2.2 (Fresh initial state). Every finite scaffolding automaton $A$ has an equivalent finite scaffolding automaton $A^\star$ whose initial state occurs only before the first input symbol. The construction preserves acceptance of the empty word and every nonempty word without inserting an input step.