Exact bounds on the complexity of sequential string matching algorithms
type: Item
instance of: scholarly article
title: Exact bounds on the complexity of sequential string matching algorithms
zbMATH Open document ID: 0803.68039
author: Christophe Hancart
published in: Bulletin of the Belgian Mathematical Society - Simon Stevin
publication date: 1995-01-02T00:00:00Z
full work available at URL: https://eudml.org/doc/223646
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68U15
zbMATH DE Number: 589786
zbMATH Keywords: string matching
zbMATH Keywords: string searching
zbMATH Keywords: text editing
zbMATH Keywords: computational complexity
zbMATH Keywords: worst case behavior
zbMATH Keywords: finite automata
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 589786