Tree pattern matching from regular tree expressions
From MaRDI portal
Publication:4568263
DOI10.14736/kyb-2018-2-0221zbMath1432.68216OpenAlexW2801156625MaRDI QIDQ4568263
Djelloul Ziadi, Hadda Cherroun, Loek Cleophas, Ahlem Belabbaci
Publication date: 15 June 2018
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/147190
Cites Work
- Unnamed Item
- Unnamed Item
- K-M-P string matching revisited
- Partial derivatives of regular expressions and finite automaton constructions
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Tree template matching in ranked ordered trees by pushdown automata
- Backward Linearised Tree Pattern Matching
- Construction of tree automata from regular expressions
- THE ABSTRACT THEORY OF AUTOMATA
- Derivatives of Tree Sets with Applications to Grammatical Inference
- Pattern Matching in Trees
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- From Regular Tree Expression to Position Tree Automaton
- Left-to-right tree pattern matching
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions