Skip to main content

TREEBAG — a Short Presentation

  • Conference paper
  • First Online:

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

Abstract

This paper gives a short introduction to TREEBAG, a system that employs tree grammars and tree transducers in order to generate and transform strings, trees, numbers, pictures, and other data types.

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.

Buying options

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. Michael Barnsley. Fractals Everywhere. Academic Press, Boston, 1988.

    MATH  Google Scholar 

  2. Prank Drewes. Tree-based picture generation. Report 7/98, Univ. Bremen, 1998.

    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 Automata. Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

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

  6. William C. Rounds. Context-free grammars on trees. In Proc. 1st Annual ACM Symposium on Theory of Computing (STOG), pages 143–148, 1969.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. William C. Rounds. Tree-oriented proofs of some theorems on context-free and indexed languages. In Proc. 2nd Annual ACM Symposium on Theory of Computing (STOC), pages 109–116, 1970.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F., Knirsch, P. (2000). TREEBAG — a Short Presentation. In: Nagl, M., Schürr, A., Münch, M. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 1999. Lecture Notes in Computer Science, vol 1779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45104-8_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45104-8_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45104-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics