arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.0580cs.FLcs.DM
收藏

对称FSA的有效分治实现

Efficient Divide-and-Conquer Implementations Of Symmetric FSAs

David Pritchard

摘要:

确定性有限状态自动机(FSA)是一种抽象的顺序机,它一次读取一个包含输入字的符号。如果FSA的输出与输入符号的读取顺序无关,则FSA是对称的,即,如果输出在输入的置换下不变。我们将展示如何将对称FSA A转换为自动机般的分治过程,其中间结果不大于A的内存大小。相比之下,对于一般FSA的类似结果通过函数组合早就知道,但是需要存储器大小的指数增加。新结果可应用于并行处理和对称FSA网络。

英文摘要:

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 independent of the order in which the input symbols are read, i.e., if the output is invariant under permutations of the input. We show how to convert a symmetric FSA A into an automaton-like divide-and-conquer process whose intermediate results are no larger than the size of A's memory. In comparison, a similar result for general FSA's has been long known via functional composition, but entails an exponential increase in memory size. The new result has applications to parallel processing and symmetric FSA networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑