On ω-regular sets
From MaRDI portal
Cited in
(94)- Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
- Infinite-word languages and continuous mappings
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- More complicated questions about maxima and minima, and some closures of NP
- On alternating \(\omega\)-automata
- Accepting conditions for automata on -languages
- Language-theoretical representations of \(\omega\)-languages
- Fine hierarchy of regular \(\omega\)-languages
- The Borel hierarchy is infinite in the class of regular sets of trees
- \(X\)-automata on \(\omega\)-words
- Finite acceptance of infinite words
- Various hierarchies of \(\omega\)-regular sets
- Chain automata
- Fixed point characterization of infinite behavior of finite-state systems
- On syntactic congruences for \(\omega\)-languages
- Ambiguity in omega context free languages
- A hierarchy of deterministic context-free \(\omega\)-languages.
- Borel hierarchy and omega context free languages.
- How to decide continuity of rational functions on infinite words
- Efficient minimization of deterministic weak -automata
- A characterization of Büchi tree automata
- On omega context free languages which are Borel sets of infinite rank.
- Wadge-Wagner hierarchies
- Input-driven pushdown automata on well-nested infinite strings
- Descriptive set theory, from Cantor to Wadge and beyond
- Turing reducibility in the fine hierarchy
- Certifying inexpressibility
- On the separation question for tree languages
- Boolean algebras of regular languages
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Bounded model checking of infinite state systems
- Effective wadge hierarchy in computable quasi-Polish spaces
- Expressive power of non-deterministic evolving recurrent neural networks in terms of their attractor dynamics
- Going beyond Turing with P automata: partial adult halting and regular observer -languages
- On the weak index problem for game automata
- A Fine Hierarchy of ω-Regular k-Partitions
- Well-Quasi Orders and Hierarchy Theory
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- The Wadge hierarchy of Petri nets \(\omega\)-languages
- The Algebraic Counterpart of the Wagner Hierarchy
- Some Algebraic Properties of Machine Poset of Infinite Words
- Complexity of Topological Properties of Regular ω-Languages
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- Hierarchies and reducibilities on regular languages related to modulo counting
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
- On infinitary finite length codes
- Sequential mappings of \omega -languages
- Fine hierarchies via Priestley duality
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- THE WAGNER HIERARCHY
- The Wadge-Wagner hierarchy of ω-rational sets
- A survey on difference hierarchies of regular languages
- Computing the Rabin Index of a Parity Automaton
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- 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
- On the high complexity of Petri nets -languages
- Regular tree languages in low levels of the Wadge hierarchy
- 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
- Polishness of some topologies related to word or tree automata
- THE MISSING LINK FOR ω-RATIONAL SETS, AUTOMATA, AND SEMIGROUPS
- Computer science and the fine structure of Borel sets
- Topological properties of omega context-free languages
- Wadge hierarchy of omega context-free languages
- Zielonka DAG acceptance and regular languages over infinite words
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Logic vs topology on regular -languages
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Two Effective Properties of ω-Rational Functions
- Semantic flowers for good-for-games and deterministic automata
- Perspective games
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Half-positional objectives recognized by deterministic Büchi automata
- Wadge degrees of \(\mathbf{\Delta}^0_2\) omega-powers
- Characterizations of rational \(\omega\)-languages by means of right congruences
- The forty nine Kuratowski lattices in the Cantor space
- Complexity aspects of the extension of Wagner's hierarchy to k-partitions
- Some regular -powers in the Hausdorff-Kuratowski hierarchy
- Optimal transformations of games and automata using Muller conditions
- Deterministic and game separability for regular languages of infinite trees
- Average reward reinforcement learning for omega-regular and mean-payoff objectives
- Applications of discrete-time interval-based temporal separation
- Expressive power of first-order recurrent neural networks determined by their attractor dynamics
- Prefix-free languages as \(\omega\)-generators
- Finite-state \(\omega\)-languages
- Alternating finite automata on -words
- Towards a descriptive set theory for domain-like structures
- The Rabin index of parity games: its complexity and approximation
- Topological complexity of locally finite \(\omega\)-languages
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication: On ω-regular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873568)