arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.04864cs.FLmath.CO
收藏

同步自动机与最小复位字语言

Synchronizing automata and the language of minimal reset words

Emanuele Rodaro

摘要:

我们研究了同步自动机和它的最小复位字集$M$之间的联系,即,使得没有适当的因子是复位字。我们首先表明,任何同步自动机具有一组最小的复位字,其一组因素不包含一个字的长度最多$\frac{1}{4}\min\{|u|: u\in I\}+\frac{1}{16}$有一个复位字的长度最多$(n-\frac{1}{2})^{2}$在最后一部分的文件中,我们专注于存在一个给定的理想$I$,作为一组复位字的同步自动机。为此,我们引入了(不一定是正规的)理想$I=Σ^{*}MΣ^{*}$的尾部结构的概念。有了这个工具,我们首先证明了存在一个无限强连接的同步自动机$\mathcal{A}$具有$I$作为一组复位字,使每一个其他强连接的同步自动机具有$I$作为一组复位字是一个同态图像的$\mathcal{A}$。最后,我们表明,对于任何非一元正规理想$I$有一个强连接的同步自动机有$I$作为一组复位字与最多$(km^{k})2^{km^{k}n}$状态,其中$k=|Σ|$,$m$是最短的字在$M$的长度,$n$是识别$M$(状态复杂度$M$)的最小自动机的尺寸。这个自动机是可计算的,我们展示了一个算法来计算它的时间$\mathcal{O}((k^{2}m^{k})2^{km^{k}n})$。

英文摘要:

We study a connection between synchronizing automata and its set $M$ of minimal reset words, i.e., such that no proper factor is a reset word. We first show that any synchronizing automaton having the set of minimal reset words whose set of factors does not contain a word of length at most $\frac{1}{4}\min\{|u|: u\in I\}+\frac{1}{16}$ has a reset word of length at most $(n-\frac{1}{2})^{2}$ In the last part of the paper we focus on the existence of synchronizing automata with a given ideal $I$ that serves as the set of reset words. To this end, we introduce the notion of the tail structure of the (not necessarily regular) ideal $I=Σ^{*}MΣ^{*}$. With this tool, we first show the existence of an infinite strongly connected synchronizing automaton $\mathcal{A}$ having $I$ as the set of reset words and such that every other strongly connected synchronizing automaton having $I$ as the set of reset words is an homomorphic image of $\mathcal{A}$. Finally, we show that for any non-unary regular ideal $I$ there is a strongly connected synchronizing automaton having $I$ as the set of reset words with at most $(km^{k})2^{km^{k}n}$ states, where $k=|Σ|$, $m$ is the length of a shortest word in $M$, and $n$ is the dimension of the smallest automaton recognizing $M$ (state complexity of $M$). This automaton is computable and we show an algorithm to compute it in time $\mathcal{O}((k^{2}m^{k})2^{km^{k}n})$.

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

↑