Incremental Construction of Compact Acyclic NFAs
نویسندگان
چکیده
This paper presents and analyzes an incremental algorithm for the construction of Acyclic Nondeterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFAs that do not contain equivalent states. Unlike Deterministic Finite-state Automata (DFA), this property is not sufficient to ensure minimality, but still the resulting NFAs are considerably smaller than the minimal DFAs for the same languages.
منابع مشابه
Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) for a dictionary consisting of a list of input and output strings. The algorithm generalises a known method of constructing minimal finite-state automata (Daciuk et al., 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings...
متن کاملOn-Line Construction of Compact Directed Acyclic Word Graphs
A Compact Directed Acyclic Word Graph (CDAWG) is a space–efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on–line algorithm for its construction, as well as the construction of a CDAWG for a set of strings.
متن کاملSuccinct Descriptions of Regular Languages with Binary +-NFAs
Champarnaud [1] analyzed the number of states obtained from a binary ⊕-NFA during the subset construction. We extend this work to an experimental analysis of the size of the minimal DFAs obtained from binary ⊕-NFAs. We then consider the number of distinct languages accepted by binary ⊕-NFAs, and compare that to Domaratzki’s results [2] for (traditional) binary NFAs. We also show that there are ...
متن کاملConstruction of minimal DFAs from biological motifs
Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple nondeterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs c...
متن کاملIncremental Construction of Minimal Sequential Transducers
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finite-state automata (Daciuk, Mihov, Watson and Watson 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings to be s...
متن کامل