Cites work
- Algebraic semantics
- Bottom-up and top-down tree transformations— a comparison
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- Extended macro grammars and stack controlled machines
- Formal computations of non deterministic recursive program schemes
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3763319 (Why is no real title available?)
- scientific article; zbMATH DE number 3490487 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Mappings and grammars on trees
- Nested Stack Automata
- On jump-deterministic pushdown automata
- Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
Cited in
(33)- Variétés d'automates descendants d'arbres infinis
- Reductions in tree replacement systems
- Pushdown machines for the macro tree transducer
- High level tree transducers and iterated pushdown tree transducers
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Generalized automata on infinite trees and Muller-McNaughton's theorem
- A geometric hierarchy beyond context-free languages
- The equivalence of bottom-up and top-down tree-to-graph transducers
- On two families of forests
- Synchronized tree automata
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- On two-way tree automata
- Yield-languages of two-way pushdown tree automata
- Decidability of EDT0L structural equivalence
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Linear weighted tree automata with storage and inverse linear tree homomorphisms
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- An Automata Characterisation for Multiple Context-Free Languages
- Variable tree automata over infinite ranked alphabets
- Controlled term rewriting
- Restarting Tree Automata and Linear Context-Free Tree Languages
- Regular Approximation of Weighted Linear Context-Free Tree Languages
- Tree-stack automata
- Regular matching problems for infinite trees
- Bottom-up tree pushdown automata and rewrite systems
- Rigid tree automata and applications
- Basic tree transducers
- Automata on infinite objects and their applications to logic and programming
- Tree-walking-storage automata
- Decidability of equivalence for deterministic synchronized tree automata
- Deterministic tree-walking-storage automata
- Deterministic real-time tree-walking-storage automata
- Deterministic real-time tree-walking-storage automata
This page was built for publication: Pushdown tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036724)
