Example DFA Synthesized Using Forlan

Here is an example deterministic finite automaton that was synthesized using Forlan:

Example Deterministic Finite Automaton

This DFA accepts all strings of 0s and 1s such that every long substring stutters (has an occurrence of 00 or 11). Here "long" is a parameter of the synthesis procedure; in this example, it's set to 5. (To see if a string is accepted, process the string's symbols, from left to right, beginning at the start state (A). If you end up in an accepting (double-ringed) state, the string is accepted; otherwise it's rejected.) Note the symmetry of the automaton.

Alley Stoughton (alley.stoughton@icloud.com)