PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS

DOI10.1142/S0129054110007234zbMath1192.68419MaRDI QIDQ3569270

Cătălin Ionuţ Tîrnăucă, Andreas Maletti

Publication date: 18 June 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular tree languagetree transducertree bimorphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (1)

Equational tree transformations

Cites Work

• Unnamed Item
• Compositions of extended top-down tree transducers
• Morphismes et bimorphismes d'arbres
• Alphabetic tree relations
• Generalized sequential machine maps
• A syntax directed compiler for ALGOL 60
• The Power of Extended Top-Down Tree Transducers
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Tree transducers and tree languages
• Forêts Algébriques et Homomorphismes Inverses
• Composition of top-down and bottom-up tree transductions
• Mappings and grammars on trees
• Alphabetic and synchronized tree transducers

This page was built for publication: PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS