Optimal Regular Tree Pattern Matching Using Pushdown Automata
نویسندگان
چکیده
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.
منابع مشابه
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata
Trees are one of the fundamental data structures used in Computer Science. We present a new kind of acyclic pushdown automata, the tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton, constructed for an ordered tree. These automata accept all tree patterns and nonlinear tree patterns, respectively, which match the tree and represent a full index of the tree for suc...
متن کاملSubtree matching by pushdown automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented. The ...
متن کاملSimple Tree Pattern Matching for Trees in the Prefix Bar Notation
A new pushdown automata based algorithm for searching all occurrences of a tree pattern in a subject tree is presented. The algorithm allows pattern matching with don’t care symbols and multiple patterns. A simulation algorithm is also proposed, and practical experimental results are presented.
متن کاملBranching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children of a tree node in possibly different control states but with identical stacks. We propose branching pushdown tree automata (BPTAs) as a solution. In a BPTA, a push-move views its matching pops as an unbounded, unorde...
متن کاملA Novel Algorithm for Pattern Matching Based on Modified Push-Down Automata
In this paper we propose a new algorithm called MEPda (Motif Extraction algorithm based on Push-down automata) to solve the problem of finding patterns containing loops. These loop-patterns or loop-motifs are very known and used in many domains, especially in mathematics and bioinformatics. MEPda meant to find these kinds of patterns by using pushdown automata as a mechanism of matching process...
متن کامل