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.
|Numero di pagine||21|
|Rivista||International Journal of Foundations of Computer Science|
|Volume||Volume 23, Issue 2 (2012)|
|Stato di pubblicazione||Published - 2012|
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)