Efficient Divide-and-Conquer Implementations Of Symmetric FSAs

David Pritchard

A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is i…