On the size of Boyer–Moore automata

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 automa...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 410; no. 43; pp. 4432 - 4443
Main Authors Baeza-Yates, Ricardo, Bruyère, Véronique, Delgrange, Olivier, Scheihing, Rodrigo
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.10.2009
Online AccessGet full text

Cover

More Information
Summary: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 Ω ( 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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2009.07.024