A characterization of attributed tree transformations by a subclass of macro tree transducers

DOI10.1007/s002240000135zbMath0943.68103OpenAlexW2073732751WikidataQ127764052 ScholiaQ127764052MaRDI QIDQ1125799

Heiko Vogler, Zoltán Fülöp

Publication date: 3 January 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

attributed tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Weighted finite automata over strong bimonoids ⋮ Characterizing attributed tree translations in terms of macro tree transducers ⋮ Varieties of recognizable tree series over fields