Automata on finite trees
From MaRDI portal
Publication:2074209
DOI10.4171/AUTOMATA-1/7MaRDI QIDQ2074209FDOQ2074209
Authors: Christof Löding, Wolfgang Thomas 
Publication date: 4 February 2022
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Characterizing EF and EX tree logics
- Regular tree languages definable in FO and in FO mod
- Tree-Walking Automata
- Transitive closure logic, nested tree walking automata, and XPath
- Title not available (Why is that?)
- Rewriting Techniques and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision Problems of Finite Automata Design and Related Arithmetics
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Translations on a context free grammar
- Title not available (Why is that?)
- Languages and scanners
- Tree acceptors and some of their applications
- Tree generating regular systems
- Complementing deterministic tree-walking automata
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking automata cannot be determinized
- The Complexity of Translating Logic to Finite Automata
- Derivation trees of ground term rewriting systems.
- Piecewise testable tree languages
- Regular canonical systems
- Title not available (Why is that?)
- Finite automata and the logic of one-place predicates
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Generalizations of regular sets and their application to a study of context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-order logic on finite trees
- Title not available (Why is that?)
- Reachability problems on regular ground tree rewriting graphs
- A decidable characterization of locally testable tree languages
Cited In (17)
- Title not available (Why is that?)
- Multitree automata that count
- Top-down complementation of automata on finite trees
- Arbology: Trees and Pushdown Automata
- The Power-Set Construction for Tree Algebras
- Finite tree automata with cost functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating automata on infinite trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a representation of tree automata
- Rigid Tree Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A model of finite automata on timed omega-trees
- On context-free trees
Uses Software
This page was built for publication: Automata on finite trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074209)
