The top-down general algorithm. The Bottom-Up Algorithm for Acyclic FSAs Initialization Find all states with no outgoing arcs. Merge states in all the above subsets, reattaching arcs as appropriate.
Input symbols are only a and b.
Back to top , the Challenge page, or to syllabus . If either set is empty, discard it. Repeat the Main loop. Input symbols are only a and b. No further split possible.