Fine hierarchy of regular -languages
From MaRDI portal
Publication:1127312
DOI10.1016/S0304-3975(97)00301-0zbMATH Open0908.68085OpenAlexW2054090612MaRDI QIDQ1127312FDOQ1127312
Authors: Victor Selivanov 
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
Recommendations
- Fine hierarchy of regular \(\omega\)-languages
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- Fine Hierarchy of Regular Aperiodic ω-Languages
- A classification of \(\omega\)-regular languages
- Publication:3030812
- Beyond $\omega$-Regular Languages
- Brzozowski hierarchy of \(\omega\)-languages
- The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata
- Finitely generated \(\omega\)-languages
- Well-quasi-orders and regular \(\omega\)-languages
Cites Work
- Title not available (Why is that?)
- Descriptive set theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Sequential Conditions by Finite-State Strategies
- On ω-regular sets
- Title not available (Why is that?)
- Fine hierarchies and Boolean terms
- Title not available (Why is that?)
- Hierarchies of hyperarithmetical sets and functions
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fine hierarchy of regular \(\omega\)-languages
- Refined hierarchy of formulas
- Fine hierarchy and definable index sets
- Structural complexity of \(\omega\)-automata
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
- The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata
Cited In (40)
- Topological properties of omega context-free languages
- Families of DFAs as Acceptors of omega-Regular Languages
- Borel hierarchy and omega context free languages.
- Logic vs topology on regular \(\omega \)-languages
- Title not available (Why is that?)
- On omega context free languages which are Borel sets of infinite rank.
- Effective wadge hierarchy in computable quasi-Polish spaces
- Title not available (Why is that?)
- A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
- The Shrinking Property for NP and coNP
- Fine hierarchies via Priestley duality
- Fine hierarchy of regular \(\omega\)-languages
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- Two Effective Properties of ω-Rational Functions
- The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata
- Fine hierarchies and m-reducibilities in theoretical computer science
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity
- Descriptive set theory and \(\omega\)-powers of finitary languages
- The Algebraic Counterpart of the Wagner Hierarchy
- A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I
- Complexity of Topological Properties of Regular ω-Languages
- Well-quasi-orders and regular \(\omega\)-languages
- A classification of \(\omega\)-regular languages
- Title not available (Why is that?)
- Fine Hierarchy of Regular Aperiodic ω-Languages
- On the separation question for tree languages
- The shrinking property for NP and coNP
- Wadge degrees of \(\mathbf{\Delta}^0_2\) omega-powers
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
- Well-Quasi Orders and Hierarchy Theory
- Wadge-Wagner hierarchies
- Towards a descriptive set theory for domain-like structures
- A Fine Hierarchy of ω-Regular k-Partitions
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- Wadge hierarchy of omega context-free languages
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- On the high complexity of Petri nets \(\omega \)-languages
- Ambiguity in omega context free languages
- Fixpoints, games and the difference hierarchy
- The Wadge hierarchy of Petri nets \(\omega\)-languages
This page was built for publication: Fine hierarchy of regular \(\omega\)-languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127312)
