The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Text algorithms
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
| Hi-index | 5.23 |
In this work we study the size of Boyer-Moore automata introduced in Knuth, Morris & Pratt's famous paper on pattern matching. We experimentally show that a finite class of binary patterns produce very large Boyer-Moore automata, and find one particular case which we conjecture, generates automata of size @W(m^6). Further experimental results suggest that the maximal size could be a polynomial of O(m^7), or even an exponential O(2^0^.^4^m), where m is the length of the pattern.