Figure 4: The finite automaton whose state 0 begins non-loose chains and state 1 loose chains The automaton is symmetric: states with uppercase names are symmetrically related with corresponding lowercase states.
it suffices to define the initial and uppercase-named states: 0 the initial state for a non-loose chain; I a bidirectional chain: Z a 3-turn chain; 1 the initial (and only) state for a loose chain; Not all states make these distinctions.