Determinacy and Rewriting of Top-Down and MSO Tree Transformations

DOI10.1007/978-3-642-40313-2_15zbMath1398.68104OpenAlexW1543197034MaRDI QIDQ2849905

Michael Benedikt, Sebastian Maneth, Joost Engelfriet

Publication date: 20 September 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_15

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (4)

Decision Problems of Tree Transducers with Origin ⋮ Decision problems of tree transducers with origin ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Two-way pebble transducers for partial functions and their composition

This page was built for publication: Determinacy and Rewriting of Top-Down and MSO Tree Transformations