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

最低有效位优先Presburger自动机

Least Significant Digit First Presburger Automata

Jérôme Leroux

摘要:

自1969年\cite{C-MST69,S-SMJ77}以来,我们知道任何Presburger可定义的集合\cite{P-PCM29}(一组满足整数的一阶加法理论中的公式的整数向量)都可以用一种基于状态的符号表示来表示,本文称之为有限数字向量自动机(FDVA)。最近已经开发了用于操纵这些集合的有效算法。然而,决定FDVA是否代表这样一个集合的问题是一个众所周知的难题,Muchnik在1991年首先用四倍指数时间算法解决了这个难题。在本文中,我们将展示如何确定在多项式时间是否FDVA表示Presburger可定义的集,并在这种情况下,我们提供了一个多项式时间算法,构造一个Presburger公式,定义相同的设置。

英文摘要:

Since 1969 \cite{C-MST69,S-SMJ77}, we know that any Presburger-definable set \cite{P-PCM29} (a set of integer vectors satisfying a formula in the first-order additive theory of the integers) can be represented by a state-based symmbolic representation, called in this paper Finite Digit Vector Automata (FDVA). Efficient algorithms for manipulating these sets have been recently developed. However, the problem of deciding if a FDVA represents such a set, is a well-known hard problem first solved by Muchnik in 1991 with a quadruply-exponential time algorithm. In this paper, we show how to determine in polynomial time whether a FDVA represents a Presburger-definable set, and we provide in this positive case a polynomial time algorithm that constructs a Presburger-formula that defines the same set.

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

↑