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 (1994)
- Volume: 1, Issue: 2, page 239-252
- ISSN: 1370-1444
Access Full Article
top
How to cite
topHancart, 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 1.2 (1994): 239-252. <http://eudml.org/doc/223646>.
@article{Hancart1994,
author = {Hancart, Christophe},
journal = {Bulletin of the Belgian Mathematical Society - Simon Stevin},
keywords = {string matching; string searching; text editing; computational complexity; worst case behavior; finite automata},
language = {eng},
number = {2},
pages = {239-252},
publisher = {Société Mathématique de Belgique - Belgisch Wiskundig Genootschap},
title = {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.)},
url = {http://eudml.org/doc/223646},
volume = {1},
year = {1994},
}
TY - JOUR
AU - Hancart, Christophe
TI - 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.)
JO - Bulletin of the Belgian Mathematical Society - Simon Stevin
PY - 1994
PB - Société Mathématique de Belgique - Belgisch Wiskundig Genootschap
VL - 1
IS - 2
SP - 239
EP - 252
LA - eng
KW - string matching; string searching; text editing; computational complexity; worst case behavior; finite automata
UR - http://eudml.org/doc/223646
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.