TY - GEN
T1 - Tree template matching in ranked ordered trees by pushdown automata
AU - Flouri, Tomáš
AU - Janoušek, Jan
AU - Melichar, Bořivoj
AU - Iliopoulos, Costas S.
AU - Pissis, Solon P.
PY - 2011/8/11
Y1 - 2011/8/11
N2 - We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the general case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.
AB - We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the general case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.
UR - http://www.scopus.com/inward/record.url?scp=79961176158&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79961176158&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22256-6_25
DO - 10.1007/978-3-642-22256-6_25
M3 - Conference contribution
AN - SCOPUS:79961176158
SN - 9783642222559
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 273
EP - 281
BT - Implementation and Application of Automata - 16th International Conference, CIAA 2011, Proceedings
T2 - 16th International Conference on Implementation and Application of Automata, CIAA 2011
Y2 - 13 July 2011 through 16 July 2011
ER -