Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 2003: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science pp 326–337Cite as

The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2914))

Abstract

Every composition of macro tree transducers that is a function of linear size increase can be realized by just one macro tree transducer. For a given composition it is decidable whether or not it is of linear size increase; if it is, then an equivalent macro tree transducer can be constructed effectively.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  MathSciNet  Google Scholar 

  2. Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information Systems 27, 21–39 (2002)

    Article  MATH  Google Scholar 

  3. Berlea, A., Seidl, H.: Transforming XML documents using fxt. J. of Computing and Information Technology 10, 19–35 (2002)

    Article  MATH  Google Scholar 

  4. Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126, 53–75 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Drewes, F., Engelfriet, J.: Decidability of finiteness of ranges of tree transductions. Inform. and Comput. 145, 1–50 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154, 34–91 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Engelfriet, J., Maneth, S.: Output string languages of compositions of deterministic macro tree transducers. JCSS 64, 350–395 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39, 613–698 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32, 950–1006 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Engelfriet, J.: On tree transducers for partial functions. Informat. Processing Let. 7, 170–172 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS 31, 71–146 (1985)

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  13. Fülöp, Z., Vogler, H.: Syntax-Directed Semantics – Formal Models based on Tree Transducers. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (1998)

    Google Scholar 

  14. Ganzinger, H., Giegerich, R.: Attribute coupled grammars. In: Proc. ACM Symp. on Compiler Construction, SIGPLAN Not., vol. 19, pp. 157–170 (1984)

    Google Scholar 

  15. Giegerich, R.: Composition and evaluation of attribute coupled grammars. Acta Informatica 25, 355–423 (1988)

    Article  MathSciNet  Google Scholar 

  16. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Springer, Heidelberg (1997)

    Google Scholar 

  17. Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2, 127–145 (1968), Corrections in Math. Systems Theory 5, 95–96 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kühnemann, A.: Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technical University Dresden (1997)

    Google Scholar 

  19. Maneth, S.: The complexity of compositions of deterministic tree transducers. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 265–276. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Maneth, S., Neven, F.: Recursive structured document transformations. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol. 1949, pp. 80–98. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. of Comp. Syst. Sci. 66, 66–97 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. Perst, T., Seidl, H.: Macro forest transducers. To appear in IPL

    Google Scholar 

  23. Tozawa, A.: Towards static type checking for XSLT. In: Proceeding of the ACM Symposium on Document Engineering, pp. 18–27. ACM Press, New York (2001)

    Google Scholar 

  24. Vianu, V.: A Web Odyssey: From Codd to XML. In: Proc. PODS 2001, pp. 1–15. ACM Press, New York (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swiss Institute of Technology Lausanne, Programming Methods Laboratory (LAMP), CH-1015, Lausanne, Switzerland

    Sebastian Maneth

Authors
  1. Sebastian Maneth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Institute of Fundamental Research, India

    Paritosh K. Pandya

  2. Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, India

    Jaikumar Radhakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maneth, S. (2003). The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation