The following pages link to Pushdown tree automata (Q3036724):
Displaying 29 items.
- Rigid tree automata and applications (Q553317) (← links)
- Basic tree transducers (Q579951) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- Variétés d'automates descendants d'arbres infinis (Q1079382) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- A geometric hierarchy beyond context-free languages (Q1200806) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- On two families of forests (Q1323385) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- On two-way tree automata (Q1327293) (← links)
- Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
- Linear weighted tree automata with storage and inverse linear tree homomorphisms (Q2051842) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- An Automata Characterisation for Multiple Context-Free Languages (Q2817383) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
- Regular Approximation of Weighted Linear Context-Free Tree Languages (Q4605512) (← links)
- Tree-stack automata (Q4879207) (← links)
- (Q5028483) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
