On-line construction of a small automaton for a finite set of words

Laura Giambruno, Maxime Crochemore

Risultato della ricerca: Other

1 Citazioni (Scopus)

Abstract

In this paper we describe a ``light'' algorithm for the on-line constructionof a small automaton recognising a finite set of words.The algorithm runs in linear time.We carried out good experimental results on thesuffixes of a text, showing how this automaton is small. For thesuffixes of a text, we propose a modified construction that leadsto an even smaller automaton.
Lingua originaleEnglish
Numero di pagine14
Stato di pubblicazionePublished - 2009

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cita questo