arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.08174math.LOcs.FLcs.LO
收藏

有限秩Borel类的单计数器语言的完全$ω$ -幂

Some complete $ω$-powers of a one-counter language, for any Borel class of finite rank

Olivier Finkel, Dominique Lecomte

摘要:

证明了对任意自然数n $\ge$ 1,可以找到一个有限字母表$Σ$和一个被一计数器自动机接受的$Σ$上的有限语言L,使得$ω$ -幂L $\infty$:= {w 0 w 1. .. $\in$ $Σ$ $ω$| $\forall$ i $\in$ $ω$ w i $\in$ L}是$Π$ 0 n-完全的。对于类$Σ$ 0 n,我们证明了一个类似的结果.

英文摘要:

We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $Σ$ and a finitary language L over $Σ$ accepted by a one-counter automaton, such that the $ω$-power L $\infty$ := {w 0 w 1. .. $\in$ $Σ$ $ω$ | $\forall$i $\in$ $ω$ w i $\in$ L} is $Π$ 0 n-complete. We prove a similar result for the class $Σ$ 0 n .

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

↑