Abstract
We introduce a tree transducer model combining aspects of both attributed tree transducers and monadic datalog, thereby allowing to specify in one rule information transport for non-adjacent nodes. We show that our model is strictly more powerful than attributed tree transducers, and we identify a large syntactic subclass which is as powerful as attributed tree transducers. This is shown by an effective construction. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Büchse, M., & Stüber, T. (2009). Monadic datalog tree transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 267–278). https://doi.org/10.1007/978-3-642-00982-2_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
