Fine hierarchy of regular \(\omega\)-languages
From MaRDI portal
Publication:1127312
DOI10.1016/S0304-3975(97)00301-0zbMath0908.68085OpenAlexW2054090612MaRDI QIDQ1127312
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00301-0
Related Items (30)
On omega context free languages which are Borel sets of infinite rank. ⋮ The Wadge Hierarchy of Petri Nets ω-Languages ⋮ Towards a descriptive set theory for domain-like structures ⋮ A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I ⋮ A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II ⋮ Effective wadge hierarchy in computable quasi-Polish spaces ⋮ Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ Ambiguity in omega context free languages ⋮ Borel hierarchy and omega context free languages. ⋮ The Algebraic Counterpart of the Wagner Hierarchy ⋮ The Shrinking Property for NP and coNP ⋮ The shrinking property for NP and coNP ⋮ Logic vs topology on regular \(\omega \)-languages ⋮ Two Effective Properties of ω-Rational Functions ⋮ Fine hierarchies via Priestley duality ⋮ Unnamed Item ⋮ Complexity of Topological Properties of Regular ω-Languages ⋮ FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the separation question for tree languages ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ A Fine Hierarchy of ω-Regular k-Partitions ⋮ Fixpoints, games and the difference hierarchy ⋮ Wadge Degrees ofω-Languages of Deterministic Turing Machines ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity ⋮ Wadge-Wagner hierarchies ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words
Cites Work
- Hierarchies of hyperarithmetical sets and functions
- Descriptive set theory
- The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata
- Refined hierarchy of formulas
- Fine hierarchy and definable index sets
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- On ω-regular sets
- Structural complexity of ω-automata
- Fine hierarchies and Boolean terms
- Fine hierarchy of regular ω-languages
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
- Solving Sequential Conditions by Finite-State Strategies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fine hierarchy of regular \(\omega\)-languages
