Adaptive non-linear pattern matching automata

MaRDI QIDQ5028442zbMATH OpenFDO

Authors Rick Erkens, Maurice Laveaux

Publication date 9 February 2022

Full work available at URL https://arxiv.org/abs/2011.13752, https://lmcs.episciences.org/8863

zbMATH Keywords

pattern matchingterm indexingtree automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 1949659
• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
• scientific article; zbMATH DE number 2043417
• scientific article; zbMATH DE number 1497852
• More efficient left-to-right matching for overlapping pattern

Cites work

• Adaptive Pattern Matching
• An account of implementing applicative term rewriting
• Experiments with discrimination-tree indexing and path indexing for term retrieval
• Optimizing pattern matching
• Substitution tree indexing
• Term indexing
• The anatomy of vampire. Implementing bottom-up procedures with code trees
• The Complexity of Trie Index Construction

Cited in

(1)

• Adaptive Pattern Matching

Describes a project that uses

Uses Software

• VAMPIRE

This page was built for publication: Adaptive non-linear pattern matching automata

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