arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.06683cs.FL
收藏

向量加法系统语言的无界性问题

Unboundedness problems for languages of vector addition systems

Wojciech Czerwiński, Piotr Hofman, Georg Zetzsche

摘要:

具有初始标记和最终标记以及过渡标签的向量加法系统(VAS)诱导语言。部分原因是VAS中的可达性问题还远未得到很好的理解,因此很难为这些语言设计决策程序。这对于检查声明存在无限多个特定形状的单词的属性尤其如此。非正式地,我们称之为\emph{unboundedness properties}。我们提出了一套简单的公理谓词,可以表达无界性。我们的主要结果是,这样的谓词是可判定的VAS语言,只要它是可判定的正则语言。在其他结果中,这使我们能够显示可判定性(i)~有界正则语言的可分性,(ii)~无界的语言$K$的发生因素与温和的条件$K$,和(iii)~普遍性的因素集。

英文摘要:

A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we call these \emph{unboundedness properties}. We present a simple set of axioms for predicates that can express unboundedness properties. Our main result is that such a predicate is decidable for VAS languages as soon as it is decidable for regular languages. Among other results, this allows us to show decidability of (i)~separability by bounded regular languages, (ii)~unboundedness of occurring factors from a language $K$ with mild conditions on $K$, and (iii)~universality of the set of factors.

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

↑