一句话:证明当折扣因子为 Pisot 数时,实值折扣和自动机保持整数情形的良好闭包与可判定性。
论文研究非确定性折扣和自动机(NDA)在实值折扣因子下的性质。此前已知整数折扣因子具有良好计算性质,如可确定化、对 min/max/加/减封闭,且等价、包含等经典判定问题可判定;非整数有理折扣因子则缺乏这些性质,且可判定性未决。作者证明:只要 λ 是 Pisot 数,λ-NDA 就保留整数情形的全部良好性质,且不同 Pisot 折扣因子的 NDA 也可比较。方法上推广 Pisot 基下的数表示并与 NDA 联系;反过来证明,若某类 λ-NDA 对确定化或代数运算封闭,则 λ 必为 Pisot 数且权重在 Q(λ) 中。结果对有限字和无限字自动机均成立。
A nondeterministic discounted-sum automaton (NDA) values a run by the discounted sum of the visited transition weights. That is, the weight in the i-th position of a run of a λ-NDA is divided by λi, for a fixed discount factor λ > 1. This allows to model systems in which the influence of current events is more significant than that of future ones, a key paradigm in economics and other disciplines. NDAs were considered so far with respect to a rational discount factor λ. It is known that for every integer λ > 1, the class of λ-NDAs has good computational properties: it is closed under determinization and under the algebraic operations min, max, addition, and subtraction, and there are algorithms for the classic decision problems, such as equivalence and containment, on its automata. On the other hand, for every rational λ ϵ Q \ N, the class of λ-NDAs lacks these closure properties, and it is open whether the classic decision problems on it are decidable. This situation significantly limits the usage of NDAs, as integral discount factors enforce at least a double decay in each step of the computation, and only allow for a very coarse decay granularity. We study NDAs with real discount factors, and show that for every Pisot number λ, the class of λ-NDAs retains all of the above good computational properties of integral NDAs. Furthermore, as is the case with integral discount factors, we show that it is also decidable to compare two NDAs with different Pisot discount factors. To this end, we generalize known results on the representation of numbers in Pisot base, and connect them to NDAs. Complementing our positive results, we show that if a class of λ-NDAs is closed under determinization or under algebraic operations, then the discount factor λ must be a Pisot number and the transition weights must be in Q(λ). All our results hold equally for automata on finite words and for automata on infinite words.