Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.)
Hancart, Christophe
Bulletin of the Belgian Mathematical Society - Simon Stevin, Tome 1 (1994), p. 239-252 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 1994-01-01
EUDML-ID : urn:eudml:doc:223646 
@article{00589786,
     title = {Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexit\'e des algorithmes s\'equentiels de recherche d'un motif.)},
     journal = {Bulletin of the Belgian Mathematical Society - Simon Stevin},
     volume = {1},
     year = {1994},
     pages = {239-252},
     zbl = {0803.68039},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00589786}
}

Hancart, Christophe. Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.). Bulletin of the Belgian Mathematical Society - Simon Stevin, Tome 1 (1994) pp. 239-252. http://gdmltest.u-ga.fr/item/00589786/