Minimal adaptive pattern-matching automata for efficient term rewriting
From MaRDI portal
Recommendations
Cited in
(10)- Pattern-matching algorithms based on term rewrite systems
- More efficient left-to-right matching for overlapping pattern
- Improving space, time, and termination in rewriting-based programming
- PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
- Linear compressed pattern matching for polynomial rewriting (extended abstract)
- Efficient pattern matching for non-strongly sequential term rewriting systems
- scientific article; zbMATH DE number 1497852 (Why is no real title available?)
- Optimal adaptive pattern matching
- Adaptive non-linear pattern matching automata
- Optimal adaptive pattern-matching using finite state automata
This page was built for publication: Minimal adaptive pattern-matching automata for efficient term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412586)