Generating tables for bottom-up matching

DOI10.1007/978-3-662-21551-7_21zbMATH Open1503.68132OpenAlexW187013305MaRDI QIDQ5055801FDOQ5055801

Authors: E. Lippe 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_21

Recommendations

• scientific article; zbMATH DE number 1114050
• Tight complexity bounds for term matching problems
• Bottom-up tree acceptors
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• More efficient bottom-up multi-pattern matching in trees

Mathematics Subject Classification ID

Data structures (68P05) Grammars and rewriting systems (68Q42)

Cites Work

• Pattern Matching in Trees
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Computational Science and Its Applications – ICCSA 2004
• Uniformly Generating Origin Destination Tables

This page was built for publication: Generating tables for bottom-up matching

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