Pages that link to "Item:Q1924627"
From MaRDI portal
The following pages link to A taxonomy of sublinear multiple keyword pattern matching algorithms (Q1924627):
Displayed 11 items.
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (Q1853605) (← links)
- A new regular grammar pattern matching algorithm. (Q1874408) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)