TY - JOUR
T1 - Waiting time and complexity for matching patterns with automata
AU - Crochemore, M.
AU - Stefanov, Valeri
PY - 2003
Y1 - 2003
N2 - The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and applying recent results on them. (C) 2003 Elsevier B.V. All rights reserved.
AB - The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and applying recent results on them. (C) 2003 Elsevier B.V. All rights reserved.
U2 - 10.1016/S0020-0190(03)00271-0
DO - 10.1016/S0020-0190(03)00271-0
M3 - Article
SN - 0020-0190
VL - 87
SP - 119
EP - 125
JO - Information Processing Letters
JF - Information Processing Letters
IS - 3
ER -