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

关于某些Ω幂具有给定复杂度的字典集

On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity

Olivier Finkel

摘要:

字典是一个有限字母表X上的有限词的集合。字典V的Ω幂是通过V中的词的无限连接获得的无限词的集合。Lecomte在[Ω幂和描述性集合论,JSL 2005]中研究了其相关Ω幂具有给定复杂度的字典集合的复杂度。特别地,他考虑了字典$V \subseteq 2^\star$的集合$W({\bf\Si}^0_{k})$(分别为$W({\bfΠ}^0_{k})$、$W({\bfΔ}_1^1)$),其Ω幂是${\bf\Si}^0_{k}$ -集合(分别为${\bfΠ}^0_{k}$ -集合、Borel集合)。本文首先建立了集合$W({\bfΣ}^0_{2})$与集合$W({\bfΔ}_1^1)$之间的一种新的关系,证明了集合$W({\bfΔ}_1^1)$比集合$W({\bfΣ}^0_{2})$“更复杂”.作为应用,我们改进了Lecomte给出的关于$W({\bfΔ}_1^1)$复杂度的下界.然后,我们证明,对于每一个整数$k\geq 2$,(分别为$k\geq 3$)的字典集$W({\bfΠ}^0_{k+1})$(分别为$W({\bf\Si}^0_{k+1})$)是“更复杂”的字典集$W({\bfΠ}^0_{k})$(分别为$W({\bf\Si}^0_{k})$)。

英文摘要:

A dictionary is a set of finite words over some finite alphabet X. The omega-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [Omega-powers and descriptive set theory, JSL 2005] the complexity of the set of dictionaries whose associated omega-powers have a given complexity. In particular, he considered the sets $W({\bf\Si}^0_{k})$ (respectively, $W({\bfΠ}^0_{k})$, $W({\bfΔ}_1^1)$) of dictionaries $V \subseteq 2^\star$ whose omega-powers are ${\bf\Si}^0_{k}$-sets (respectively, ${\bfΠ}^0_{k}$-sets, Borel sets). In this paper we first establish a new relation between the sets $W({\bfΣ}^0_{2})$ and $W({\bfΔ}_1^1)$, showing that the set $W({\bfΔ}_1^1)$ is "more complex" than the set $W({\bfΣ}^0_{2})$. As an application we improve the lower bound on the complexity of $W({\bfΔ}_1^1)$ given by Lecomte. Then we prove that, for every integer $k\geq 2$, (respectively, $k\geq 3$) the set of dictionaries $W({\bfΠ}^0_{k+1})$ (respectively, $W({\bf\Si}^0_{k+1})$) is "more complex" than the set of dictionaries $W({\bfΠ}^0_{k})$ (respectively, $W({\bf\Si}^0_{k})$) .

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

↑