Monadic Datalog Tree Transducers

Authors:
Matthias Büchse;Torsten Stüber
Affiliations:
Faculty of Computer Science, Technische Universität Dresden, Dresden, Germany 01062;Faculty of Computer Science, Technische Universität Dresden, Dresden, Germany 01062
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 5
Cited 0

Term rewriting and all that

Term rewriting and all that
A comparison of tree transductions defined by monadic second order logic and by attribute grammars

Journal of Computer and System Sciences
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Syntax-Directed Semantics: Formal Models Based on Tree Transducers

Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.