A tree pattern matching algorithm with reasonable space requirements

  • Jochen Burghardt
Tree Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 299)


Destination State Matching Process Subject Tree Outgoing Transition Root Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9 References

  1. [Aho 75]
    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 1975Google Scholar
  2. [Bur 85]
    Jochen Burghardt, ”Mathematische Strukturen zur Musteridentifizierung auf mehrdimensionalen Zeichenfeldern” (”Mathematical Structures for Pattern Matching in Multi Dimensional Symbol Fields”), Thesis, September 1985Google Scholar
  3. [Bur 88]
    Jochen Burghardt, ”A New Tree Pattern Matching Algorithm”, Arbeitspapiere der GMDGoogle Scholar
  4. [Cha 87]
    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 1987Google Scholar
  5. [Hof 82]
    Christoph M. Hoffmann, Michael J. O'Donnell, ”Pattern Matching in Trees”, Journal of the ACM, Vol.29, No.1, pp.68–95, January 1982Google Scholar
  6. [Wei 73]
    Peter Weiner, ”Linear Pattern Matching Algorithms”, in: Conf. Record, IEEE 14th Annual Symposium on Switching and Automata Theory, 1973Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jochen Burghardt
    • 1
  1. 1.GMD Forschungsstelle an der Universität KarlsruheKarlsruhe

Personalised recommendations