Automata on finite trees
From MaRDI portal
Publication:2074209
Recommendations
Cites work
- scientific article; zbMATH DE number 3888931 (Why is no real title available?)
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 44695 (Why is no real title available?)
- scientific article; zbMATH DE number 408785 (Why is no real title available?)
- scientific article; zbMATH DE number 522865 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- A decidable characterization of locally testable tree languages
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Characterizing EF and EX tree logics
- Complementing deterministic tree-walking automata
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision Problems of Finite Automata Design and Related Arithmetics
- Derivation trees of ground term rewriting systems.
- Finite automata and the logic of one-place predicates
- First-order logic on finite trees
- Generalizations of regular sets and their application to a study of context-free languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Languages and scanners
- Piecewise testable tree languages
- Reachability problems on regular ground tree rewriting graphs
- Regular canonical systems
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
- Rewriting Techniques and Applications
- The Complexity of Translating Logic to Finite Automata
- Transitive closure logic, nested tree walking automata, and XPath
- Translations on a context free grammar
- Tree acceptors and some of their applications
- Tree generating regular systems
- Tree-Walking Automata
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking automata cannot be determinized
Cited in
(17)- On context-free trees
- Alternating automata on infinite trees
- scientific article; zbMATH DE number 7310132 (Why is no real title available?)
- Finite tree automata with cost functions
- scientific article; zbMATH DE number 1494251 (Why is no real title available?)
- scientific article; zbMATH DE number 3866601 (Why is no real title available?)
- Top-down complementation of automata on finite trees
- scientific article; zbMATH DE number 1870551 (Why is no real title available?)
- scientific article; zbMATH DE number 7362732 (Why is no real title available?)
- A model of finite automata on timed omega-trees
- Arbology: Trees and Pushdown Automata
- The Power-Set Construction for Tree Algebras
- scientific article; zbMATH DE number 1051240 (Why is no real title available?)
- On a representation of tree automata
- Rigid Tree Automata
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- Multitree automata that count
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)
