Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FSTTCS
1998
Springer

favoriteEmaildiscussreport

131views Software Engineering» more FSTTCS 1998»

Optimal Regular Tree Pattern Matching Using Pushdown Automata

13 years 8 months ago

Optimal Regular Tree Pattern Matching Using Pushdown Automata

Download drona.csa.iisc.ernet.in

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.

Maya Madhavan, Priti Shankar

Real-time Traffic

FSTTCS 1998 | Pattern Matching | Pattern Matching Automaton | Software Engineering | Tree Pattern |

claim paper

Related Content

» TypeBased Optimization for Regular Patterns

» Regular Expression Matching in Reconfigurable Hardware

» Spacetime tradeoff in regular expression matching with semideterministic finite automata

» HigherOrder Matching Games and Automata

» A Case Study on GrammaticalBased Representation for Regular Expression Evolution

» XML transformation by treewalking transducers with invisible pebbles

» XML Transformation Language Based on Monadic Second Order Logic

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	1998
Where	FSTTCS
Authors	Maya Madhavan, Priti Shankar

Comments (0)