The universality of higher-order attributed tree transducers

DOI10.1007/S002240010018zbMath0969.68091OpenAlexW1978715427MaRDI QIDQ5929088

Thomas Noll, Heiko Vogler

Publication date: 7 October 2001

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

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

zbMATH Keywords

attributed tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations

This page was built for publication: The universality of higher-order attributed tree transducers