Waiting time and complexity for matching patterns with automata
type: Item
instance of: scholarly article
title: Waiting time and complexity for matching patterns with automata
zbMATH Open document ID: 1161.68760
DOI: 10.1016/S0020-0190(03)00271-0
published in: Information Processing Letters
publication date: 2009-04-28T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5547788
zbMATH Keywords: string matching algorithm
zbMATH Keywords: Markov chain
zbMATH Keywords: stopping time
zbMATH Keywords: algorithms
zbMATH Keywords: formal languages
Wikidata QID: Q61677956
author: Maxime Crochemore
author: Valeri T. Stefanov
MaRDI profile type: Publication
cites work: Q4167890
cites work: Conditionality resolutions
cites work: On Simon's string searching algorithm
cites work: Fast Pattern Matching in Strings
cites work: A unified approach to word occurrence probabilities
cites work: Q4304002
cites work: Explicit distributional results in pattern formation
cites work: Explicit Distributional Results In Pattern Formation II
full work available at URL: s0020-0190(03)00271-0
OpenAlex ID: W1980260642
description: scientific article; zbMATH DE number 5547788