交换自动机的一种紧凑编码
On a compact encoding of the swap automaton
摘要:
给定在大小为$σ$的字母表$Σ$上的长度为$m$的字符串$P$,$P$的交换版本是通过一系列局部交换从$P$导出的字符串,即,相邻符号的交换,使得每个符号可以参与至多一个交换。本文对语言$\bigcup_{P'\inΠ_P}Σ^*P'$的非确定性有限自动机(简称交换自动机)进行了理论分析,其中$Π_P$是$P$的交换版本集.我们的研究是基于位并行模拟相同的自动机由于Fredriksson,并揭示了一个有趣的组合属性,链接自动机的语言$Σ^*P$。通过利用这个特性和Cantone等人提出的方法。(2010),我们获得了交换自动机的位并行编码,它占用$O(σ^2\ceil{k/w})$空间,并允许人们在时间$O(n\ceil{k/w})$上模拟长度为$n$的字符串上的自动机,其中$\ceil{m/σ}\le k\le m$。
英文摘要:
Given a string $P$ of length $m$ over an alphabet $Σ$ of size $σ$, a swapped version of $P$ is a string derived from $P$ by a series of local swaps, i.e., swaps of adjacent symbols, such that each symbol can participate in at most one swap. We present a theoretical analysis of the nondeterministic finite automaton for the language $\bigcup_{P'\inΠ_P}Σ^*P'$ (swap automaton for short), where $Π_P$ is the set of swapped versions of $P$. Our study is based on the bit-parallel simulation of the same automaton due to Fredriksson, and reveals an interesting combinatorial property that links the automaton to the one for the language $Σ^*P$. By exploiting this property and the method presented by Cantone et al. (2010), we obtain a bit-parallel encoding of the swap automaton which takes $O(σ^2\ceil{k/w})$ space and allows one to simulate the automaton on a string of length $n$ in time $O(n\ceil{k/w})$, where $\ceil{m/σ}\le k\le m$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。