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

数量语言的表达性和闭包性质

Expressiveness and Closure Properties for Quantitative Languages

Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger

摘要:

加权自动机是在变迁上具有数值权重的不确定自动机。它们可以定义量化语言$L$,为每个词$w$分配一个实数$L(w)$。在无限字的情况下,游程的值自然计算为转换权重的最大值、limsup、liminf、极限平均值或贴现和。字$w$的值是在$w$上的游程的值的上确界。我们研究这些定量语言的表达性和封闭性问题。我们首先证明,对于确定性极限平均和贴现和自动机,值大于阈值的单词集合可以是非$ω$ -正则的,而当阈值是孤立的时,这个集合总是$ω$ -正则的(即,阈值周围的某些邻域不包含字)。在后一种情况下,我们证明了$ω$ -正则语言对过渡权重的小扰动是鲁棒的。接下来我们考虑带转移权的自动机,加权自动机是在转移上具有数值权的不确定自动机。它们可以定义量化语言$L$,为每个词$w$分配一个实数$L(w)$。在无限单词的情况下,arun的值自然计算为转移权重的最大值、limsup、liminf、limit-average或discounted-sum。字$w$的值是在$w$上运行的值的上确界。我们研究这些数量语言的表达性和封闭性问题。我们首先证明了对于确定性的极限平均和贴现Sumautomata,值大于阈值的词集合可以是非$ω$ -正则的,而当阈值孤立时,这个集合总是$ω$ -正则的(即,阈值周围的某些邻域不包含字)。在后一种情况下,我们证明了$ω$ -正则语言对转移权的小扰动是鲁棒的。接下来,我们考虑自动机与过渡权重$0$或$1$和表明thatthey是一般的加权自动机在极限平均的情况下,但不是在折扣和的情况下表达。第三,对于定量语言$L_1$和~ $L_2$,我们考虑了运算$\max(L_1,L_2)$、$\min(L_1,L_2)$和$1-L_1$,它们推广了语言上的布尔运算,以及和$L_1 + L_2$。我们建立了所有数量语言类关于这四种运算的封闭性。$ or $,并表明它们是一般的加权自动机的有限平均的情况下,但不是在贴现和的情况下表达。第三,对于数量语言$L_1$和~ $L_2$,我们考虑了运算$\max(L_1,L_2)$,$\min(L_1,L_2)$和-L_1 $, which generalize the boolean operations on languages, as well as the sum $ L_1 + L_2$。我们建立封闭性的所有类的定量语言就这四个操作。

英文摘要:

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word $w$ is the supremum of the values of the runs over $w$. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-$ω$-regular for deterministic limit-average and discounted-sum automata, while this set is always $ω$-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the $ω$-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights Weighted automata are nondeterministic automata with numerical weights ontransitions. They can define quantitative languages~$L$ that assign to eachword~$w$ a real number~$L(w)$. In the case of infinite words, the value of arun is naturally computed as the maximum, limsup, liminf, limit-average, ordiscounted-sum of the transition weights. The value of a word $w$ is thesupremum of the values of the runs over $w$. We study expressiveness andclosure questions about these quantitative languages. We first show that the set of words with value greater than a threshold canbe non-$ω$-regular for deterministic limit-average and discounted-sumautomata, while this set is always $ω$-regular when the threshold isisolated (i.e., some neighborhood around the threshold contains no word). Inthe latter case, we prove that the $ω$-regular language is robust againstsmall perturbations of the transition weights. We next consider automata with transition weights $0$ or $1$ and show thatthey are as expressive as general weighted automata in the limit-average case,but not in the discounted-sum case. Third, for quantitative languages $L_1$ and~$L_2$, we consider the operations$\max(L_1,L_2)$, $\min(L_1,L_2)$, and $1-L_1$, which generalize the booleanoperations on languages, as well as the sum $L_1 + L_2$. We establish theclosure properties of all classes of quantitative languages with respect tothese four operations.$ or $ and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages $L_1$ and~$L_2$, we consider the operations $\max(L_1,L_2)$, $\min(L_1,L_2)$, and -L_1$, which generalize the boolean operations on languages, as well as the sum $L_1 + L_2$. We establish the closure properties of all classes of quantitative languages with respect to these four operations.

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

↑