Tree pattern matching from regular tree expressions.
From MaRDI portal
Publication:4568263
Recommendations
Cites work
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- Backward linearised tree pattern matching
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Construction of tree automata from regular expressions
- Derivatives of Regular Expressions
- Derivatives of Tree Sets with Applications to Grammatical Inference
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- From regular tree expression to position tree automaton
- K-M-P string matching revisited
- Left-to-right tree pattern matching
- Partial derivatives of regular expressions and finite automaton constructions
- Pattern Matching in Trees
- Programming Techniques: Regular expression search algorithm
- THE ABSTRACT THEORY OF AUTOMATA
- Tree template matching in ranked ordered trees by pushdown automata
Cited in
(8)- Simple tree pattern matching for trees in the prefix bar notation
- Regular matching and inclusion on compressed tree patterns with context variables
- Left-to-right tree pattern matching
- Caterpillars, context, tree automata and tree pattern matching
- Tree pattern expression for extracting information from syntactically parsed text corpora
- Tree template matching in ranked ordered trees by pushdown automata
- Tree template matching in ranked ordered trees by pushdown automata
- Regular matching and inclusion on compressed tree patterns with constrained context variables
This page was built for publication: Tree pattern matching from regular tree expressions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568263)