Madhavan, Maya and Shankar, Priti (1998) Optimal regular tree pattern matching using pushdown automata. In: 18th Conference on Foundations of Software Technology and Theoretical Computer Science, December 17-19, 1998, Chennai, India, pp. 122-133.
Optimal_Regular.pdf - Published Version
Restricted to Registered users only
Download (188Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright for this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||18 Sep 2004|
|Last Modified:||13 Jan 2012 06:17|
Actions (login required)