Tree transducers, L systems and two-way machines (Extended Abstract)

DOI10.1145/800133.804333zbMath1282.68154OpenAlexW2004538713MaRDI QIDQ5402542

Giora Slutzki, Grzegorz Rozenberg, Joost Engelfriet

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804333

Mathematics Subject Classification ID

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

Related Items (4)

Sur les générateurs algébriques et linéaires ⋮ The copying power of one-state tree transducers ⋮ Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time ⋮ Transductions of dags and trees

This page was built for publication: Tree transducers, L systems and two-way machines (Extended Abstract)