A pumping lemma for output languages of macro tree transducers

DOI10.1007/3-540-61064-2_28OpenAlexW295290293MaRDI QIDQ5878900

Armin Kühnemann

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_28

zbMATH Keywords

pumping lemmaprimitive recursionmacro tree transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A two-dimensional hierarchy for attributed tree transducers

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular tree transducers
• Macro tree transducers
• Tree transducers, L systems, and two-way machines
• Attribute grammars and recursive program schemes. I. II
• Tree transducers with external functions
• Intercalation lemmas for tree transducer languages
• Synthesized and inherited functions. A new computational model for syntax-directed semantics
• Generalized sequential machine maps
• A syntax directed compiler for ALGOL 60
• Bottom-up and top-down tree transformations— a comparison
• Mappings and grammars on trees
• Translations on a context free grammar

This page was built for publication: A pumping lemma for output languages of macro tree transducers