Can I read Incremental Construction of Minimal Acyclic Finite-State Automata on EtoBox?

Incremental Construction of Minimal Acyclic Finite-State Automata by Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson is a Computer Science article available to read on EtoBox.

What is Incremental Construction of Minimal Acyclic Finite-State Automata about?

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to other methods.

Who reads Incremental Construction of Minimal Acyclic Finite-State Automata?

Author

Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson

Publisher

MIT Press; Cambridge MA: MIT Press Journals; MIT Press - Journals (ISSN 0891-2017)

Published

2000

Language

EN

Field

Computer Science (Physical Sciences)