Waiting time and complexity for matching patterns with automata

Information Processing Letters

Volumn 87, Issue 3, 2003, Pages 119-125

  Crochemore, M ^a,b   Stefanov, V T ^c  

^a Université de Marne la Vallée   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Algorithms; Formal languages; Markov chain; Stopping time; String matching algorithm

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; FORMAL LANGUAGES; MARKOV PROCESSES; PROBABILITY;

STOPPING TIME;

INFORMATION SCIENCE;

EID: 0038347439     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00271-0     Document Type: Article

References (8)

1. Barndorff-Nielsen O. Information and Exponential Families. 1978;Wiley, Chichester.
2. Barndorff-Nielsen O. Conditionality resolutions. Biometrika. 67:1980;293-310.
3. Hancart C. On Simon's string searching algorithm. Inform. Process. Lett. 47:1993;95-99.
4. Knuth D.E., Morris J.H. Jr, Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:1977;320-350.
5. Régnier M. A unified approach to word occurrence probabilities. Discrete Appl. Math. 104:2000;259-280.
6. Stefanov V.T. Noncurved exponential families associated with observations over finite state Markov chains. Scand. J. Statist. 18:1991;353-356.
7. Stefanov V.T., Pakes A.G. Explicit distributional results in pattern formation. Ann. Appl. Probab. 7:1997;666-678.
8. Stefanov V.T., Pakes A.G. Explicit distributional results in pattern formation II. Austral. and New Zealand J. Statist. 41:1999;79-90.