Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1999: Fundamentals of Computation Theory pp 234–245Cite as

Exponential output size of top-down tree transducers

  • Conference paper
  • First Online:

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

Abstract

The exponential output size problem for top-down tree transducers asks whether the size of output trees grows exponentially in the size of input trees. In this paper the complexity of this problem is studied. It is shown to be NL-complete for total top-down tree transducers, but DEXPTIME-complete in general.

Article

Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Working Group APPLIGRAPH through the University of Bremen.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alfred V. Aho and Jeffrey D. Ullman. Translations on a context free grammar. Information and Control, 19:439–475, 1971.

    Article  MathSciNet  Google Scholar 

  2. Joost Engelfriet. Three hierarchies of transducers. Mathematical Systems Theory, 15:95–125, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  3. Zoltán Fülöp and Heiko Vogler. Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, 1998.

    Google Scholar 

  4. Ferenc Gècseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 1, pages 1–68. Springer, 1997.

    Google Scholar 

  5. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  6. William C. Rounds. Mappings and grammars on trees. Mathematical Systems Theory, 4:257–287, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  7. Helmut Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2):57–60, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. James W. Thatcher. Generalized2 sequential machine maps. Journal of Computer and System Sciences, 4:339–367, 1970.

    MATH  MathSciNet  Google Scholar 

  9. James W. Thatcher. Tree automata: an informal survey. In A.V. Aho, editor, Currents in the Theory of Computing, pages 143–172. Prentice Hall, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, D-28334, Bremen, Germany

    Frank Drewes

Authors
  1. Frank Drewes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F. (1999). Exponential output size of top-down tree transducers. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation