arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0604104cs.ITcs.DMmath.IT
收藏

一类有限型不可约约束系统的Shannon覆盖

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

Akiko Manada, Navin Kashyap

摘要:

在自动机理论文献中,Crochemore、Meclosi和Restivo的一个构造给出了有限型约束系统(FTCS)的一个表示,该系统是确定性的,并且具有相对较少的状态。因此,这种构造是确定FTCS的最小确定性表示(称为香农覆盖)的一个很好的起点。我们详细分析了Crochemore-Mingsi-Restivo(CMR)建设的情况下,禁止的单词定义的FTCS的列表的大小最多为两个。我们表明,如果FTCS是不可约的,那么一个不可约的介绍系统可以很容易地通过删除规定的几个国家从CMR介绍。通过研究这种不可约表示中状态的跟随集,我们能够在某些情况下明确地确定香农覆盖。特别是,我们的研究结果表明,CMR建设直接产生的香农覆盖的情况下,一个不可约的FTCS正好有一个禁止字,但这不是一般的情况下,FTCS的两个禁止字。

英文摘要:

A construction of Crochemore, Mignosi and Restivo in the automata theory literature gives a presentation of a finite-type constrained system (FTCS) that is deterministic and has a relatively small number of states. This construction is thus a good starting point for determining the minimal deterministic presentation, known as the Shannon cover, of an FTCS. We analyze in detail the Crochemore-Mignosi-Restivo (CMR) construction in the case when the list of forbidden words defining the FTCS is of size at most two. We show that if the FTCS is irreducible, then an irreducible presentation for the system can be easily obtained by deleting a prescribed few states from the CMR presentation. By studying the follower sets of the states in this irreducible presentation, we are able to explicitly determine the Shannon cover in some cases. In particular, our results show that the CMR construction directly yields the Shannon cover in the case of an irreducible FTCS with exactly one forbidden word, but this is not in general the case for FTCS's with two forbidden words.

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

↑