Alternating tree automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4083011
- Alternating automata on infinite trees
- Alternating two-way AC-tree automata
- scientific article
- Tree automata
- scientific article; zbMATH DE number 168434
- \(L\)-valued alternating tree automata
- Alternating Tree Automata and Parity Games
- Alternating register automata on finite words and trees
- Iterative tree automata
Cites work
- scientific article; zbMATH DE number 3814988 (Why is no real title available?)
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- scientific article; zbMATH DE number 3301432 (Why is no real title available?)
- Alternation
- Bottom-up and top-down tree transformations— a comparison
- Classes of Pebble Games and Complete Problems
- Complexity of Boolean algebras
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Parallel and two-way automata on directed ordered acyclic graphs
- Probabilistic tree automata and context free languages
- Provably Difficult Combinatorial Games
- Tree acceptors and some of their applications
- Tree transducers, L systems, and two-way machines
Cited in
(28)- scientific article; zbMATH DE number 168434 (Why is no real title available?)
- Alternating automata on infinite trees
- Decision procedures for inductive Boolean functions based on alternating automata
- Synchronized tree automata
- A grammatical characterization of alternating pushdown automata
- The finite graph problem for two-way alternating automata.
- Alphabetic and synchronized tree transducers
- Decidability of equivalence for deterministic synchronized tree automata
- An alternating hierarchy for finite automata
- An Infinite Automaton Characterization of Double Exponential Time
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Alternating two-way AC-tree automata
- Decidable containment of recursive queries
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Constructions for alternating finite automata∗
- Alternating Tree Automata and Parity Games
- \(L\)-valued alternating tree automata
- Concurrent program schemes and their logics
- Yield-languages recognized by alternating tree recognizers
- Yield-languages of two-way pushdown tree automata
- ALTERNATING TURING MACHINES WITH MODIFIED ACCEPTING STRUCTURE
- Alternating Weighted Automata
- The time complexity of typechecking tree-walking tree transducers
- Decidability of equivalence for deterministic synchronized tree automata
- scientific article; zbMATH DE number 3967934 (Why is no real title available?)
- Top-down tree transducers with two-way tree walking look-ahead
- scientific article; zbMATH DE number 1931697 (Why is no real title available?)
- scientific article; zbMATH DE number 4083011 (Why is no real title available?)
This page was built for publication: Alternating tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077932)
