6533b82ffe1ef96bd1296260
RESEARCH PRODUCT
On-line construction of a small automaton for a finite set of words
Maxime CrochemoreL. Giambrunosubject
algorithms on stringfinite languagefinite state automatadescription
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 the suffixes of a text, showing how this automaton is small. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2009-01-01 |