Skip to main content
SpringerLink
Log in

A tree pattern matching algorithm with reasonable space requirements

  • Tree Algorithms
  • Conference paper
  • First Online:
Book cover CAAP '88 (CAAP 1988)

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

Included in the following conference series:

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.

9 References

  1. Alfred V. Aho, Margaret J. Corasick, ”Efficient String Matching: An Aid to Bibliographic Search”, Communications of the ACM, Vol.8, No.6, pp.333–340, June 1975

    Google Scholar 

  2. Jochen Burghardt, ”Mathematische Strukturen zur Musteridentifizierung auf mehrdimensionalen Zeichenfeldern” (”Mathematical Structures for Pattern Matching in Multi Dimensional Symbol Fields”), Thesis, September 1985

    Google Scholar 

  3. Jochen Burghardt, ”A New Tree Pattern Matching Algorithm”, Arbeitspapiere der GMD

    Google Scholar 

  4. David R. Chase, ”An Improvement to Bottom-up Tree Pattern Matching”, in: Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages, pp.168–177, January 1987

    Google Scholar 

  5. Christoph M. Hoffmann, Michael J. O'Donnell, ”Pattern Matching in Trees”, Journal of the ACM, Vol.29, No.1, pp.68–95, January 1982

    Google Scholar 

  6. Peter Weiner, ”Linear Pattern Matching Algorithms”, in: Conf. Record, IEEE 14th Annual Symposium on Switching and Automata Theory, 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD Forschungsstelle an der Universität Karlsruhe, Haid-und-Neu-Straße 7, D-7500, Karlsruhe

    Jochen Burghardt

Authors
  1. Jochen Burghardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Dauchet M. Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burghardt, J. (1988). A tree pattern matching algorithm with reasonable space requirements. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026092

Download citation

  • DOI: https://doi.org/10.1007/BFb0026092

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19021-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation