Researchers have published a paper detailing the properties of $\omega$-powers of one-counter languages within the difference hierarchy. The study proves the existence of a finite alphabet and a finitary language accepted by a one-counter automaton, where its $\omega$-power is $D_{2n-1}(\mathbf{\Pi}^0_k)$-complete. Additionally, the paper presents conditional results concerning dual classes and Wadge degrees of rational $\omega$-powers, building upon recent work in the field. AI
RANK_REASON Academic paper published on arXiv detailing theoretical computer science concepts. [lever_c_demoted from research: ic=1 ai=0.1]
- arXiv
- $D_{2n-1}(\mathbf{\Pi}^0_k)$
- $D^-_{2n}(\mathbf{\Pi}^0_3)$
- $D^-_{2n}(\mathbf{\Pi}^0_k)$
- $D^-_n(\mathbf{\Pi}^0_k)$
- [FGL26]
- Olivier Finkel
- $\\Sigma$
- $U_{n,k}$
- $U_{n,k}^\infty$
- $V_{n,3}$
- $V_{n,3}^\infty$
- $V_{n,k}$
- $V_{n,k}^\infty$
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →