Automata on infinite trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3866588 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 3711381 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1136080 (Why is no real title available?)
- scientific article; zbMATH DE number 1929935 (Why is no real title available?)
- scientific article; zbMATH DE number 2102739 (Why is no real title available?)
- scientific article; zbMATH DE number 5794052 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Alternating automata on infinite trees
- Alternating automata, the weak monadic theory of trees and its complexity
- An Antichain Algorithm for LTL Realizability
- Automata theory and its applications
- Automata, logics, and infinite games. A guide to current research
- Choice functions and well-orderings over the infinite binary tree
- Computer science logic. 21st international workshop, CSL 2007, 16th annual conference of the EACSL, Lausanne, Switzerland, September 11--15, 2007. Proceedings.
- Computing Simulations over Tree Automata
- Computing the Rabin Index of a Parity Automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding Equivalence of Finite Tree Automata
- Deciding low levels of tree-automata hierarchy
- Deciding the weak definability of Büchi definable tree languages
- Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Fair simulation
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Propositional dynamic logic of looping and converse is elementarily decidable
- Pushdown processes: Games and model-checking
- Rabin's uniformization problem
- Rational \(\omega\)-languages are non-ambiguous
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Solving Sequential Conditions by Finite-State Strategies
- Solving parity games in big steps
- The Monadic Theory of Tree-like Structures
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- The modal mu-calculus alternation hierarchy is strict
Cited in
(9)- Alternating automata on infinite trees
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
- Prolog infinite trees and automata
- scientific article; zbMATH DE number 1870551 (Why is no real title available?)
- The Power-Set Construction for Tree Algebras
- A game-theoretic approach for the synthesis of complex systems
- Synthesis in presence of dynamic links
- scientific article; zbMATH DE number 1522569 (Why is no real title available?)
- scientific article; zbMATH DE number 219444 (Why is no real title available?)
This page was built for publication: Automata on infinite trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074210)
