Tree pushdown automata

DOI10.1016/0022-0000(85)90002-9zbMath0565.68080OpenAlexW1990748319MaRDI QIDQ1058866

Jean H. Gallier, Karl M. Schimpf

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90002-9

zbMATH Keywords

context-free tree languagestree pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Synchronized tree automata, Bottom-up tree pushdown automata: Classification and connection with rewrite systems, On two-way tree automata, Alternating two-way AC-tree automata, Bottom-up tree pushdown automata and rewrite systems, Yield-languages of two-way pushdown tree automata, Deterministic tree pushdown automata and monadic tree rewriting systems, Restarting Tree Automata and Linear Context-Free Tree Languages, Unnamed Item, On characterization of fuzzy tree pushdown automata, The equivalence of bottom-up and top-down tree-to-graph transducers, Lattice-valued tree pushdown automata: pumping lemma and closure properties

Cites Work

• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Syntactic methods in pattern recognition
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Optimization of LR(k) parsers
• Tree Systems for Syntactic Pattern Recognition
• Parsing macro grammars top down
• A Class of Projective Planes
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Nested Stack Automata
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item