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

周期正则语言的半直积分解

Semidirect Product Decompositions for Periodic Regular Languages

Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki

AI总结:

本研究将有限状态马尔可夫链的周期定义推广到正则语言,证明正则语言的周期对应其句法幺半群中的循环群,给出周期为P的充要条件,并探究该结果与马尔可夫链、语言概率理论及Krohn-Rhodes分解的关联。

摘要:

有限状态马尔可夫链中周期的定义可通过考虑接受正则语言的确定有限自动机(DFA)的转移,推广到正则语言领域。例如,语言$(ΣΣ)^*$的周期为2,因为其DFA中递归(循环)的长度必须为偶数。本文证明,正则语言的周期在其句法幺半群中表现为一个循环群。具体而言,我们证明:一个正则语言具有周期$P$,当且仅当其句法幺半群同构于某一特定有限幺半群与$P$阶循环群的半直积的一个子幺半群。此外,我们探究了马尔可夫链结构与本研究结果之间的关系,并将该关系应用于语言概率理论。我们还讨论了与我们的方法紧密相关的有限半群的Krohn-Rhodes分解。

英文摘要:

The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(ΣΣ)^*$ has period two because the length of a recursion (cycle) in its DFA must be even. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period $P$ if and only if its syntactic monoid is isomorphic to a submonoid of a semidirect product between a specific finite monoid and the cyclic group of order $P$. Moreover, we explore the relation between the structure of Markov chains and our result, and apply this relation to the theory of probabilities of languages. We also discuss the Krohn-Rhodes decomposition of finite semigroups, which is strongly linked to our methods.

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

↑