Deterministic and game separability for regular languages of infinite trees
From MaRDI portal
Cites work
- A gap property of deterministic tree languages.
- A Note on Decidable Separability by Piecewise Testable Languages
- Adding Successor
- Ambiguous classes in \(\mu\)-calculi hierarchies
- An approach to computing downward closures
- An Approach to Regular Separability in Vector Addition Systems
- Automata, logics, and infinite games. A guide to current research
- Cost automata, safe schemes, and downward closures
- Deciding low levels of tree-automata hierarchy
- Deciding parity games in quasipolynomial time
- Deciding the topological complexity of Büchi languages
- Deciding the weak definability of Büchi definable tree languages
- scientific article; zbMATH DE number 1670861 (Why is no real title available?)
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1136080 (Why is no real title available?)
- scientific article; zbMATH DE number 1954388 (Why is no real title available?)
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Index problems for game automata
- On finite monoids having only trivial subgroups
- On ω-regular sets
- Recognisability for algebras of infinite trees
- Regular languages of infinite trees that are Boolean combinations of open sets
- Regular separability of one counter automata
- Regular separability of Parikh automata
- Regular separability of well-structured transition systems
- Regular tree languages in low levels of the Wadge hierarchy
- Separability of reachability sets of vector addition systems
- Separating regular languages with first-order logic
- Solving Sequential Conditions by Finite-State Strategies
- Star height via games
- The diagonal problem for higher-order recursion schemes is decidable
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- Timed games and deterministic separability
- Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
- Weak index versus Borel rank
This page was built for publication: Deterministic and game separability for regular languages of infinite trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241226)
