A two-dimensional hierarchy for attributed tree transducers

DOI10.1007/BFB0036191MaRDI QIDQ5055942zbMATH OpenOpenAlexFDO

Authors Armin Kühnemann

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0036191

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• The generating power of total deterministic tree transducers
• scientific article; zbMATH DE number 3858450
• scientific article; zbMATH DE number 1200800
• The universality of higher-order attributed tree transducers
• A characterization of attributed tree transformations by a subclass of macro tree transducers

Cites work

• A pumping lemma for output languages of macro tree transducers
• Attributed tree grammars
• Composition and evaluation of attribute coupled grammars
• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 3740783 (Why is no real title available?)
• scientific article; zbMATH DE number 709440 (Why is no real title available?)
• Passes, sweeps, and visits in attribute grammars
• Semantic evaluation from left to right
• Semantics of context-free languages
• Synthesized and inherited functions. A new computational model for syntax-directed semantics
• Tree transducers with external functions

Cited in

(5)

• The generating power of total deterministic tree transducers
• Composing stack-attributed tree transducers
• Characterizing important subclasses of attributed tree transformations by macro tree transducers
• Tree automata and attribute grammars
• The universality of higher-order attributed tree transducers

This page was built for publication: A two-dimensional hierarchy for attributed tree transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055942)