Nonlinear pattern matching in trees

DOI10.1145/128749.128752MaRDI QIDQ4302812zbMATH OpenOpenAlexFDO

Authors

Publication date 21 August 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/128749.128752

zbMATH Keywords

theorem provingnormalizationrewritingnonlinear pattern matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4060735
• scientific article; zbMATH DE number 4053042
• Parallel tree pattern matching
• Patterns and pattern-matching in trees: An analysis
• scientific article; zbMATH DE number 4041265

Cited in

(15)

• Non-contiguous pattern avoidance in binary trees
• Efficient tree pattern unification
• A set automaton to locate all pattern matches in a term
• Patterns and pattern-matching in trees: An analysis
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• A survey on tree edit distance and related problems
• scientific article; zbMATH DE number 1956456 (Why is no real title available?)
• Comparing trees via crossing minimization
• scientific article; zbMATH DE number 4060735 (Why is no real title available?)
• A metric normalization of tree edit distance
• Automata-driven efficient subterm unification
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Noncontiguous pattern containment in binary trees
• scientific article; zbMATH DE number 4041265 (Why is no real title available?)
• scientific article; zbMATH DE number 125882 (Why is no real title available?)

This page was built for publication: Nonlinear pattern matching in trees

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