Automata on infinite trees
From MaRDI portal
Publication:2074210
DOI10.4171/Automata-1/8MaRDI QIDQ2074210
Publication date: 4 February 2022
Related Items
The Power-Set Construction for Tree Algebras, A game-theoretic approach for the synthesis of complex systems, Synthesis in presence of dynamic links
Cites Work
- Solving parity games in big steps
- Choice functions and well-orderings over the infinite binary tree
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Rational \(\omega\)-languages are non-ambiguous
- Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
- Alternating automata on infinite trees
- Alternating automata, the weak monadic theory of trees and its complexity
- The modal mu-calculus alternation hierarchy is strict
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Pushdown processes: Games and model-checking
- Fair simulation
- Automata, logics, and infinite games. A guide to current research
- Computer science logic. 21st international workshop, CSL 2007, 16th annual conference of the EACSL, Lausanne, Switzerland, September 11--15, 2007. Proceedings.
- Rabin's uniformization problem
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Deciding Equivalence of Finite Tree Automata
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- An Antichain Algorithm for LTL Realizability
- Propositional dynamic logic of looping and converse is elementarily decidable
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- The Monadic Theory of Tree-like Structures
- Deciding low levels of tree-automata hierarchy
- Computing the Rabin Index of a Parity Automaton
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Computing Simulations over Tree Automata
- Solving Sequential Conditions by Finite-State Strategies
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automata theory and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
