Efficient tree pattern unification

DOI10.1007/BFB0037425MaRDI QIDQ6560197zbMATH OpenFDO

Authors Peter Ružička

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/BFB0037425

Mathematics Subject Classification ID

Data structures (68P05) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 522867
• scientific article; zbMATH DE number 4053042
• scientific article; zbMATH DE number 176505
• More efficient bottom-up multi-pattern matching in trees
• On the sequential nature of unification

Cites work

• An almost linear Robinson unification algorithm
• Efficient string matching
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 522867 (Why is no real title available?)
• Nonlinear pattern matching in trees
• Parallel construction of a suffix tree with applications
• Pattern Matching in Trees

This page was built for publication: Efficient tree pattern unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560197)