Aho-Corasick like multiple subtree matching by pushdown automata

Authors:
Tomáš Flouri;Bořivoj Melichar;Jan Janoušek
Affiliations:
Czech Technical University in Prague, Prague, Czech Republic;Czech Technical University in Prague, Prague, Czech Republic;Czech Technical University in Prague, Prague, Czech Republic
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 2
Cited 0

Pattern Matching in Trees

Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple yet efficient algorithm to find all occurrences of a set of subtrees in a subject tree is described. The presented algorithm is similar to the well-known Aho-Corasick string matching method -- instead of a deterministic finite automaton a deterministic pushdown automaton is used as the computation model for reading the subject tree in prefix notation.