TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING

DOI10.1142/S012905410600439XzbMath1169.68461MaRDI QIDQ3421842

Loek Cleophas, Kees Hemerik, Gerard Zwaan

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree automatatree pattern matchingAho-Corasickroot-to-frontier

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (1)

A set automaton to locate all pattern matches in a term

Cites Work

• Unnamed Item
• Bottom-up tree acceptors
• Tree automata for code selection
• Pattern Matching in Trees
• Efficient string matching
• Faster tree pattern matching

This page was built for publication: TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING