On-line construction of a small automaton for a finite set of words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2012

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

Résumé

In this paper we describe a ''light'' algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Fichier non déposé

Dates et versions

hal-00836951 , version 1 (21-06-2013)

Identifiants

Citer

Maxime Crochemore, Laura Giambruno, Alessio Langiu. On-line construction of a small automaton for a finite set of words. International Journal of Foundations of Computer Science, 2012, 23 (2), pp.281-301. ⟨10.1142/S0129054112400138⟩. ⟨hal-00836951⟩
121 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More