Waiting time and complexity for matching patterns with automata

Maxime Crochemore 1 Valery Stefanov
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Journal articles
Complete list of metadatas
https://hal-upec-upem.archives-ouvertes.fr/hal-00619588
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, September 6, 2011 - 3:53:40 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM

Identifiers

  • HAL Id : hal-00619588, version 1

Collections

CNRS | UNIV-MLV | LIGM_ALGO | LIGM | ENPC | PARISTECH | UPEC-UPEM

Citation

Maxime Crochemore, Valery Stefanov. Waiting time and complexity for matching patterns with automata. Information Processing Letters, Elsevier, 2003, 87 (3), pp.119-125. ⟨hal-00619588⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

125

Contact

Informations

CCSD