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

异步多带自动机相交:不可判定性与近似性

Asynchronous Multi-Tape Automata Intersection: Undecidability and Approximation

Carlo A. Furia

摘要:

当他们的阅读头被允许完全异步地移动时,具有多个磁带的有限状态自动机实现了显着的表达能力,但也失去了有用的闭包性质-特别是交集下的闭包。本文研究在何种程度上仍然是可行的,使用多带自动机作为识别器的多元谓词的话。从消极的方面来看,判定异步多带自动机的交集是否可表达甚至不是半判定的。在积极的一面,我们提出了一个算法,计算下近似的交集,并讨论了简单的条件下,它可以构建完整的交集。一个原型实现和一些重要的例子证明了该算法在实践中。

英文摘要:

When their reading heads are allowed to move completely asynchronously, finite-state automata with multiple tapes achieve a significant expressive power, but also lose useful closure properties---closure under intersection, in particular. This paper investigates to what extent it is still feasible to use multi-tape automata as recognizer of polyadic predicates on words. On the negative side, determining whether the intersection of asynchronous multi-tape automata is expressible is not even semidecidable. On the positive side, we present an algorithm that computes under-approximations of the intersection; and discuss simple conditions under which it can construct complete intersections. A prototype implementation and a few non-trivial examples demonstrate the algorithm in practice.

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

↑