Automata on finite trees
From MaRDI portal
Publication:2074209
DOI10.4171/Automata-1/7MaRDI QIDQ2074209
Wolfgang Thomas, Christof Löding
Publication date: 4 February 2022
Related Items (1)
Uses Software
Cites Work
- Tree-walking automata cannot be determinized
- Complementing deterministic tree-walking automata
- Languages and scanners
- Derivation trees of ground term rewriting systems.
- Reachability problems on regular ground tree rewriting graphs
- Characterizing EF and EX tree logics
- Tree acceptors and some of their applications
- Regular tree languages definable in FO and in FO mod
- Piecewise testable tree languages
- A decidable characterization of locally testable tree languages
- Tree-Walking Automata
- Transitive closure logic, nested tree walking automata, and XPath
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Decision Problems of Finite Automata Design and Related Arithmetics
- Generalizations of regular sets and their application to a study of context-free languages
- The Complexity of Translating Logic to Finite Automata
- First-order logic on finite trees
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Regular canonical systems
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree generating regular systems
- Finite automata and the logic of one-place predicates
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Translations on a context free grammar
- Rewriting Techniques and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automata on finite trees
