Waiting time and complexity for matching patterns with automata

M. Crochemore, Valeri Stefanov

    Research output: Contribution to journalArticle

    9 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)119-125
    JournalInformation Processing Letters
    Volume87
    Issue number3
    DOIs
    Publication statusPublished - 2003

    Fingerprint Dive into the research topics of 'Waiting time and complexity for matching patterns with automata'. Together they form a unique fingerprint.

    Cite this