Optimal Regular Tree Pattern Matching Using Pushdown Automata

Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionally generated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed by conventional methods, and has been tested on some input problem instances representing instruction sets for processors.

• Type: Conference
• Year: 1998
• Where: FSTTCS
• Authors: Maya Madhavan, Priti Shankar
• Keywords: FSTTCS 1998, Pattern Matching, Pattern Matching Automaton, Software Engineering, Tree Pattern