Abstract
In this chapter, I outline a new algorithm for regular tree pattern matching. The existence of this algorithm was first mentioned in the statements accompanying my dissertation, [2]. In order to avoid repeating the material in my dissertation, it is assumed that the reader is familiar with Chapters 4 and 5 of the dissertation.
[2] WATSON, B.W. Taxonomies and Toolkits of Regular Language Algorithms, Ph.D dis
sertation, Faculty of Computing Science, Eindhoven University of Technology, The
Netherlands, 1995, ISBN 90-386-0396-7.
| Original language | English |
|---|---|
| Title of host publication | Simplex Sigillum Veri : een liber amicorum voor prof.dr. F.E.J. Kruseman Aretz |
| Editors | E.H.L. Aarts, H.M.M. Eikelder, ten, C. Hemerik, M. Rem |
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Pages | 315-320 |
| ISBN (Print) | 90-386-0197-2 |
| Publication status | Published - 1995 |