On Simon's string searching algorithm
From MaRDI portal
Recommendations
Cites work
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1256698 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- On the Exact Complexity of String Matching: Lower Bounds
- On the Exact Complexity of String Matching: Upper Bounds
Cited in
(12)- Waiting time and complexity for matching patterns with automata
- Exact bounds on the complexity of sequential string matching algorithms
- An efficient null-free procedure for deciding regular language membership
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Minimisation of automata
- On-line string matching algorithms: survey and experimental results
- On the Exact Complexity of String Matching: Upper Bounds
- A New String Matching Algorithm
- On Simon's congruence closure of a string
- String matching algorithms and automata
- Simon's congruence pattern matching
- How the character comparison order shapes the shift function of on-line pattern matching algorithms
This page was built for publication: On Simon's string searching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685473)
