跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.16473 · v2

Some complete $ω$-powers of a one-counter language in the difference hierarchy

首次提交 2026-10-12 17:26
版本更新 2026-11-12 21:04
雷达观测 2026-11-17 04:58
arXiv ↗PDF ↗

摘要

Fix a finite alphabet ΣΣ having at least two letters, and natural numbers n,k≥1n,k\geq 1. We denote by Dn(Πk0)D_n(\mathbfΠ^0_k) the class of differences of nn subsets of the Cantor space ΣωΣ^ω in Πk0\mathbfΠ^0_k, and by Dn−(Πk0)D^-_n(\mathbfΠ^0_k) the class of complements of sets in Dn(Πk0)D_n(\mathbfΠ^0_k). We prove, for any natural numbers n,k≥1n,k\geq 1, the existence of a finite alphabet ΣΣ having at least two letters and a finitary language Un,kU_{n,k} over ΣΣ accepted by a one-counter automaton such that the ωω-power Un,k∞:={w0w1⋯∈Σω∣∀i∈ω  wi∈Un,k}U_{n,k}^\infty:=\{ w_0w_1\cdots\inΣ^ω\mid\forall i\inω~~w_i\in U_{n,k}\} is D2n−1(Πk0)D_{2n-1}(\mathbfΠ^0_k)-complete. We also prove a conditional result for the dual classes D2n−(Πk0)D^-_{2n}(\mathbfΠ^0_k): under the assumption that there exists a finitary language Vn,3V_{n,3} accepted by a one-counter automaton, such that its ωω-power Vn,3∞V_{n,3}^\infty is D2n−(Π30)D^-_{2n}(\mathbfΠ^0_3)-complete, there would also exist, for any integer k>3k > 3, a finitary language Vn,kV_{n,k} accepted by a one-counter automaton, such that its ωω-power Vn,k∞V_{n,k}^\infty is D2n−(Πk0)D^-_{2n}(\mathbfΠ^0_k)-complete. Finally we add another conditionnal result about Wadge degrees of rational Δ20\mathbfΔ^0_2 omega powers, which completes the recent results of [FGL26].

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-12 21:04 · 最新观测版本

Some complete $ω$-powers of a one-counter language in the difference hierarchy

Fix a finite alphabet ΣΣ having at least two letters, and natural numbers n,k≥1n,k\geq 1. We denote by Dn(Πk0)D_n(\mathbfΠ^0_k) the class of differences of nn subsets of the Cantor space ΣωΣ^ω in Πk0\mathbfΠ^0_k, and by Dn−(Πk0)D^-_n(\mathbfΠ^0_k) the class of complements of sets in Dn(Πk0)D_n(\mathbfΠ^0_k). We prove, for any natural numbers n,k≥1n,k\geq 1, the existence of a finite alphabet ΣΣ having at least two letters and a finitary language Un,kU_{n,k} over ΣΣ accepted by a one-counter automaton such that the ωω-power Un,k∞:={w0w1⋯∈Σω∣∀i∈ω  wi∈Un,k}U_{n,k}^\infty:=\{ w_0w_1\cdots\inΣ^ω\mid\forall i\inω~~w_i\in U_{n,k}\} is D2n−1(Πk0)D_{2n-1}(\mathbfΠ^0_k)-complete. We also prove a conditional result for the dual classes D2n−(Πk0)D^-_{2n}(\mathbfΠ^0_k): under the assumption that there exists a finitary language Vn,3V_{n,3} accepted by a one-counter automaton, such that its ωω-power Vn,3∞V_{n,3}^\infty is D2n−(Π30)D^-_{2n}(\mathbfΠ^0_3)-complete, there would also exist, for any integer k>3k > 3, a finitary language Vn,kV_{n,k} accepted by a one-counter automaton, such that its ωω-power Vn,k∞V_{n,k}^\infty is D2n−(Πk0)D^-_{2n}(\mathbfΠ^0_k)-complete. Finally we add another conditionnal result about Wadge degrees of rational Δ20\mathbfΔ^0_2 omega powers, which completes the recent results of [FGL26].

查看此版本解读 →查看此版本原文 ↗