Add to ORKGAbstract. 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.
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree a...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applicatio...
Tree pattern matching is an important operation in Computer Science on which a number of tasks such ...
Abstract. Subtree matching is an important problem in Computer Science on which a number of tasks, s...
We propose a construction that augments the precomputation step of a regular tree pattern matching a...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
summary:We present a unified and systematic approach to basic principles of Arbology, a new algorith...
We report on a toolkit of tree automata and algorithms for tree acceptance, pattern matching, and pa...
AbstractWe consider the problem of tree template matching in ranked ordered trees, and propose a sol...
We consider the problem of linear regular tree pattern matching and describe a new solution based on...
AbstractWe consider the problem of linear regular tree pattern matching and describe a new solution ...
A new and simple method for target code selection by tilling an abstract syntax tree is presented. A...
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree a...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applicatio...
Tree pattern matching is an important operation in Computer Science on which a number of tasks such ...
Abstract. Subtree matching is an important problem in Computer Science on which a number of tasks, s...
We propose a construction that augments the precomputation step of a regular tree pattern matching a...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
summary:We present a unified and systematic approach to basic principles of Arbology, a new algorith...
We report on a toolkit of tree automata and algorithms for tree acceptance, pattern matching, and pa...
AbstractWe consider the problem of tree template matching in ranked ordered trees, and propose a sol...
We consider the problem of linear regular tree pattern matching and describe a new solution based on...
AbstractWe consider the problem of linear regular tree pattern matching and describe a new solution ...
A new and simple method for target code selection by tilling an abstract syntax tree is presented. A...
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree a...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applicatio...