On-Line Construction of a Small Automaton for a Finite Set of Words

@article{Crochemore2009OnLineCO,
  title={On-Line Construction of a Small Automaton for a Finite Set of Words},
  author={Maxime Crochemore and Laura Giambruno and Alessio Langiu},
  journal={Int. J. Found. Comput. Sci.},
  year={2009},
  volume={23},
  pages={281-301}
}
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… 

Figures and Tables from this paper

Interpreting the Subset Construction Using Finite Sublanguages
TLDR
This work presents a language-based approach to the well-known problem of the conversion between finite automaton (FA) types, and shows that O(e √ n ) is an upper bound on the length of strings in the FEL of its equivalent DFA.
On trace inclusion optimization problems
The following four optimization problems over a finite set of traces are considered: (i) find the longest trace that is included in each trace from a given finite set T of traces, (ii) find the

References

SHOWING 1-10 OF 29 REFERENCES
Incremental construction of minimal acyclic finite state automata
TLDR
A new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings by adding new strings one by one and minimizing the resulting automaton on-the-fly.
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
  • B. Watson
  • Computer Science
    J. Univers. Comput. Sci.
  • 2002
TLDR
A fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words for computer virus detection, computational linguistics and computational genetics.
A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata
  • B. Watson
  • Computer Science
    South Afr. Comput. J.
  • 1999
TLDR
This paper presents a taxonomy of algorithms for constructing minimal acyclic deterministic finite automata (MADFAs), which are useful in applications such as storing words for spell-checking, computer and biological virus searching, text indexing and XML tag lookup.
A new algorithm for the construction of minimal acyclic DFAs
  • B. Watson
  • Computer Science
    Sci. Comput. Program.
  • 2003
A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata
  • B. Watson
  • Computer Science
    Grammars and Automata for String Processing
  • 2003
TLDR
This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata, which facilitates the construction of very large automata in limited computer memory where other (nonincremental) algorithms would fail with intermediate data structures too large to fit in memory.
Parsing with a finite dictionary
Optimal insertion in deterministic DAWGs
Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental
Introduction to Automata Theory, Languages and Computation
Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back: Essays in Honour of Gheorghe Paun
TLDR
This work will concern you to try reading grammars and automata for string processing from mathematics and computer science to biology and back as one of the reading material to finish quickly.
...
...