cs.LOOct 12, 2026

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

Authors: Jacques Duparc, Olivier Finkel, Dominique Lecomte

Organizations: UNIL · Université de Lausanne, Département des opérations, HEC Lausanne, CH-1015, Lausanne, Switzerland · EPFL, Mathematics Section, School of Basic Sciences, CH-1015, Lausanne, Switzerland · IMJ-PRG · 

Abstract

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].

Explore similar work

CardsList
  1. Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarchy

    Sep 9, 2026Xiaoyu Li, Andi Han, Jiaojiao Jiang +1Inductive Inference