Automata for matching patterns

Maxime Crochemore 1 Christophe Hancart 2
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
Abstract : This chapter describes several methods of word pattern matching that are based on the use of automata.
Document type :
Book sections
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download
https://hal-upec-upem.archives-ouvertes.fr/hal-00620792
Contributor : Maxime Crochemore <>
Submitted on : Wednesday, February 13, 2013 - 6:30:59 PM
Last modification on : Thursday, February 7, 2019 - 5:27:59 PM
Long-term archiving on: Tuesday, May 14, 2013 - 3:59:41 AM

File

B4.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00620792, version 1

Collections

CNRS | LIGM | LIGM_ALGO | ENPC | PARISTECH | UNIV-MLV | UPEC-UPEM | LITIS | COMUE-NORMANDIE | INSA-ROUEN | UNIROUEN | UNILEHAVRE | INSA-GROUPE

Citation

Maxime Crochemore, Christophe Hancart. Automata for matching patterns. Rozenberg G., Salomaa A. Handbook of Formal Languages, 2, Linear Modeling: Background and Application, Springer-Verlag, pp.399-462, 1997. ⟨hal-00620792⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

553

Files downloads

1180

Contact

Informations

CCSD