Jan Lahoda and Jan ďárek
Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
| Abstract: |
| A new pushdown automata based algorithm for searching all occurrences of a tree pattern in a subject tree is presented. The algorithm allows pattern matching with don't care symbols and multiple patterns. A simulation algorithm is also proposed, and practical experimental results are presented. |
| Download paper: | ![]() |
![]() |
![]() |
| PostScript | BibTeX reference |