Attributed tree transducers cannot induce all deterministic bottom-up tree transformations

DOI10.1006/inco.1995.1016zbMath0827.68067OpenAlexW2050418442MaRDI QIDQ1891149

Zoltán Fülöp, Sándor Vágvölgyi

Publication date: 19 December 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1016

zbMATH Keywords

no attributed tree transducers

Mathematics Subject Classification ID

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

Related Items (4)

Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS ⋮ A comparison of tree transductions defined by monadic second order logic and by attribute grammars ⋮ Macro tree transducers, attribute grammars, and MSO definable tree translations.

This page was built for publication: Attributed tree transducers cannot induce all deterministic bottom-up tree transformations