Skip to main content
SpringerLink
Log in

Monadic Datalog Tree Transducers

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5457))

  • 837 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fülöp, Z.: On attributed tree transducers. Acta Cybernet 5, 261–279 (1981)

    MathSciNet  MATH  Google Scholar 

  2. Knuth, D.: Semantics of context–free languages. Math. Systems Theory 2, 127–145 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  3. Deransart, P., Jourdan, M., Lorho, B.: Attribute Grammars - Definitions, Systems and Bibliography. In: Deransart, P., Lorho, B., Jourdan, M. (eds.) Attribute Grammars. LNCS, vol. 323. Springer, Heidelberg (1988)

    Google Scholar 

  4. Fülöp, Z., Vogler, H.: Syntax-directed semantics — Formal Models Based on Tree Transducers. Monogr. Theoret. Comput. Sci. EATCS Ser. Springer, Heidelberg (1998)

    Book  MATH  Google Scholar 

  5. Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. J. ACM 51(1), 74–113 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  7. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  8. Chirica, L.M., Martin, D.F.: An Order-Algebraic Definition of Knuthian Semantics. Math. Systems Theory 13, 1–27 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wechler, W.: Universal Algebra for Computer Scientists, 1st edn. Monogr. Theoret. Comput. Sci. EATCS Ser., vol. 25. Springer, Heidelberg (1992)

    Book  MATH  Google Scholar 

  10. Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. System Sci. 61, 1–50 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Technische Universität Dresden, 01062, Dresden, Germany

    Matthias Büchse & Torsten Stüber

Authors
  1. Matthias Büchse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torsten Stüber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büchse, M., Stüber, T. (2009). Monadic Datalog Tree Transducers. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation