Efficient Divide-and-Conquer Implementations Of Symmetric FSAs - Computer Science > Formal Languages and Automata TheoryReport as inadecuate




Efficient Divide-and-Conquer Implementations Of Symmetric FSAs - Computer Science > Formal Languages and Automata Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: A deterministic finite-state automaton FSA is an abstract sequentialmachine that reads the symbols comprising an input word one at a time. An FSAis symmetric if its output is independent of the order in which the inputsymbols are read, i.e., if the output is invariant under permutations of theinput. We show how to convert a symmetric FSA A into an automaton-likedivide-and-conquer process whose intermediate results are no larger than thesize of A-s memory. In comparison, a similar result for general FSA-s has beenlong known via functional composition, but entails an exponential increase inmemory size. The new result has applications to parallel processing andsymmetric FSA networks.



Author: David Pritchard

Source: https://arxiv.org/







Related documents