Skip to main content
SpringerLink
Log in

The use of tree transducers to compute translations between graph algebras

  • Algorithms and Architectures
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

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

  • 167 Accesses

Abstract

The power of top-down, bottom-up, and tree-to-graph-to-tree transducers (tgt transducers) to compute translations from hyperedge-replacement algebras into edge-replacement algebras is investigated. Compositions of top-down and bottom-up tree transducers are too weak if the operations in the target algebra are powerful enough to define all series-parallel graphs, 2-trees, or related types of graphs. Tgt transducers are shown to be more powerful. These are able to compute translations into ER algebras whose operations are so-called 2tree * operations, which are generalizations of the well-known operations to generate 2-trees.

Supported by COMPUGRAPH II, ESPRIT Basic Research Working Group 7183.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brenda S. Baker. Composition of top-down and bottom-up tree transductions. Information and Control 41, 186–213, 1979.

    Google Scholar 

  2. Michel Bauderon, Bruno Courcelle. Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83–127, 1987.

    Google Scholar 

  3. Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theoretical Computer Science 80, 153–202, 1991.

    Google Scholar 

  4. Frank Drewes. The use of tree transducers to compute translations between graph algebras. Report 8/94, Univ. Bremen, 1994.

    Google Scholar 

  5. Joost Engelfriet. Bottom-up and top-down tree transformations — a comparison. Mathematical Systems Theory 9(3), 198–231, 1975.

    Google Scholar 

  6. Joost Engelfriet. On tree transducers for partial functions. Information Processing Letters 7, 170–172, 1978.

    Google Scholar 

  7. Joost Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, 241–286. Academic Press, New York, 1980.

    Google Scholar 

  8. Joost Engelfriet. Graph grammars and tree transducers. In Proc. CAAP 94, Lecture Notes in Computer Science 787, 15–37, 1994.

    Google Scholar 

  9. Joost Engelfriet, Heiko Vogler. The translation power of top-down tree-to-graph transducers. Journal of Computer and System Sciences 49, 258–305, 1994.

    Google Scholar 

  10. J. E. Hopcroft, R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135–158, 1973.

    Google Scholar 

  11. S. MacLane. A structural characterization of planar combinatorial graphs. Duke Mathematical Journal 3, 460–472, 1937.

    Google Scholar 

  12. Walter Vogler. Recognizing edge replacement graph languages in cubic time. In H. Ehrig, Hans-Jörg Kreowski, G. Rozenberg, editors, Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., Lecture Notes in Computer Science 532, 676–687, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bremen, Fachbereich 3, 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

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F. (1996). The use of tree transducers to compute translations between graph algebras. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation