Skip to main content
. 2017 Oct 25;698:67–78. doi: 10.1016/j.tcs.2017.06.016

Fig. 6.

Fig. 6

A finite automaton accepting all prefixes of length at least 3 of strings in which the only triples are AAA, AAB, AAC, ABA, BAA, BAB, CAB and CCA and in which BAAA and CABA do not occur. State 1 is initial, all states at distance 3 from the initial state are accepting. States are numbered to show that the diagram is a Wheeler graph.