Construction of minimal deterministic finite automata from biological motifs
نویسندگان
چکیده
منابع مشابه
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 deterministic finite cover automata
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal DFA for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the...
متن کاملExact Generation of Minimal Acyclic Deterministic Finite Automata
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give an upper bound for M...
متن کاملMinimal Deterministic Incomplete Automata
We construct a minimal automaton for an output-incomplete Moore automaton. The approach is motivated by physical interpretation of seeing deterministic nite automata as models for elementary particles. When compared to some classical methods our minimal automaton is unique up to an isomorphism and preserves also the unde ned or unspeci ed behaviour of the original automaton.
متن کاملLearning Minimal Deterministic Automata from Inexperienced Teachers
A prominent learning algorithm is Angluin’s L∗ algorithm, which allows to learn a minimal deterministic automaton using so-called membership and equivalence queries addressed to a teacher. In many applications, however, a teacher might be unable to answer some of the membership queries because parts of the object to learn are not completely specified, not observable, it is too expensive to reso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.12.003