Exact bounds on the complexity of sequential string matching algorithms

zbMath0803.68039MaRDI QIDQ1326953

Christophe Hancart

Publication date: 2 January 1995

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223646

zbMATH Keywords

computational complexityfinite automatastring matchingstring searchingworst case behaviortext editing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)

This page was built for publication: Exact bounds on the complexity of sequential string matching algorithms