arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0157cs.FL
收藏

大非周期半群

Large Aperiodic Semigroups

Janusz Brzozowski, Marek Szykuła

摘要:

一个正则语言的语法复杂度是它的语法半群的大小。这个半群同构于接受语言的最小确定性有限自动机的转移半群,也就是说,同构于由非空词在自动机的状态集上引起的变换生成的半群。在本文中,我们寻找的最大的语法半群的星无语言有$n$左子;等价地,我们寻找的最大的转移半群的非周期有限自动机与$n$状态。引入了两个新的非周期转移半群。第一种是由只改变一个状态的变换产生的;我们称这种变换和由此产生的半群为酉半群。特别地,我们研究了具有特殊结构的完备酉半群,证明了每个极大酉半群都是完备的。对于$n \ge 4$,存在一个完全酉半群,它大于迄今已知的任何非周期半群。然后,我们提出了更大的非周期半群,所产生的转换,映射一个非空的状态子集到一个单一的状态,我们称这样的变换和半群不稳定。特别是,我们研究了具有基于满二叉树的结构的常数树半群。常树半群是目前最大非周期半群的最佳候选者。我们还证明了$2^n-1$是无星语言反转的状态复杂度的一个上界,并解决了无星语言串接的一个特殊情况的状态复杂度的公开问题。

英文摘要:

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of a star-free language having $n$ left quotients; equivalently, we look for the largest transition semigroup of an aperiodic finite automaton with $n$ states. We introduce two new aperiodic transition semigroups. The first is generated by transformations that change only one state; we call such transformations and resulting semigroups unitary. In particular, we study complete unitary semigroups which have a special structure, and we show that each maximal unitary semigroup is complete. For $n \ge 4$ there exists a complete unitary semigroup that is larger than any aperiodic semigroup known to date. We then present even larger aperiodic semigroups, generated by transformations that map a non-empty subset of states to a single state; we call such transformations and semigroups semiconstant. In particular, we examine semiconstant tree semigroups which have a structure based on full binary trees. The semiconstant tree semigroups are at present the best candidates for largest aperiodic semigroups. We also prove that $2^n-1$ is an upper bound on the state complexity of reversal of star-free languages, and resolve an open problem about a special case of state complexity of concatenation of star-free languages.

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

↑