On Boyer-Moore automata
- 1 November 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (4-5) , 268-292
- https://doi.org/10.1007/bf01185428
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Average running time of the Boyer-Moore-Horspool algorithmTheoretical Computer Science, 1992
- Algorithms for Finding Patterns in StringsPublished by Elsevier ,1990
- The Boyer–Moore–Galil String Searching Strategies RevisitedSIAM Journal on Computing, 1986
- Open Problems in StringologyPublished by Springer Nature ,1985
- A New Proof of the Linearity of the Boyer-Moore String Searching AlgorithmSIAM Journal on Computing, 1980
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- On improving the worst case running time of the Boyer-Moore string matching algorithmCommunications of the ACM, 1979
- On the Worst-Case Behavior of String-Searching AlgorithmsSIAM Journal on Computing, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977