arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0410017cs.CVcond-mat.stat-mechcs.CLcs.DScs.IRcs.LGnlin.AOnlin.CGnlin.PSphysics.comp-phq-bio.GN
收藏

自动模式检测--多正则语言过滤器最优同步构造算法

Automated Pattern Detection--An Algorithm for Constructing Optimally Synchronizing Multi-Regular Language Filters

Carl S. McTague, James P. Crutchfield

摘要:

在一维元胞自动机的计算力学结构分析中,出现了以下来自时间序列分析的\emph{change-point problem}的自动机理论模拟:\emph{Given a string $σ$ and a collection $\{\mc{D}_i\}$ of finite automata, identify the regions of $σ$ that belong to each $\mc{D}_i$ and, in particular, the boundaries separating them.}我们提出了两种求解此\emph{multi-regular language filtering problem}的方法。第一种方法虽然提供了理想的解决方案,但需要堆栈,最坏情况下的计算时间以$σ$的长度二次增长,并在任意长的未来输入窗口上的任何点上调节其输出。第二种方法是在算法上构造近似于第一算法的换能器。然而,与基于堆栈的算法相比,传感器只需要有限的内存,在线性时间内运行,并为每个字母读取提供即时输出;此外,它是具有这三个特征的最佳有限状态近似。

英文摘要:

In the computational-mechanics structural analysis of one-dimensional cellular automata the following automata-theoretic analogue of the \emph{change-point problem} from time series analysis arises: \emph{Given a string $σ$ and a collection $\{\mc{D}_i\}$ of finite automata, identify the regions of $σ$ that belong to each $\mc{D}_i$ and, in particular, the boundaries separating them.} We present two methods for solving this \emph{multi-regular language filtering problem}. The first, although providing the ideal solution, requires a stack, has a worst-case compute time that grows quadratically in $σ$'s length and conditions its output at any point on arbitrarily long windows of future input. The second method is to algorithmically construct a transducer that approximates the first algorithm. In contrast to the stack-based algorithm, however, the transducer requires only a finite amount of memory, runs in linear time, and gives immediate output for each letter read; it is, moreover, the best possible finite-state approximation with these three features.

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

↑