16,801 research outputs found
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
non-deterministic finite automata (NFAs) and prove that the standard subset
construction transforms NFAs of this type into minimal DFAs. Furthermore, we
show how simple NFAs can be constructed from two types of patterns popular in
bioinformatics, namely (sets of) generalized strings and (generalized) strings
with a Hamming neighborhood
Enumeration of minimal acyclic automata via generalized parking functions
We give an exact enumerative formula for the minimal acyclic deterministic
finite automata. This formula is obtained from a bijection between a family of
generalized parking functions and the transitions functions of acyclic
automata
P Colony Automata with LL(k)-like Conditions
We investigate the possibility of the deterministic parsing (that is, parsing
without backtracking) of languages characterized by (generalized) P colony automata.
We de ne a class of P colony automata satisfying a property which resembles the LL(k)
property of context-free grammars, and study the possibility of parsing the characterized
languages using a k symbol lookahead, as in the LL(k) parsing method for context-free
languages
Real-Time Vector Automata
We study the computational power of real-time finite automata that have been
augmented with a vector of dimension k, and programmed to multiply this vector
at each step by an appropriately selected matrix. Only one entry
of the vector can be tested for equality to 1 at any time. Classes of languages
recognized by deterministic, nondeterministic, and "blind" versions of these
machines are studied and compared with each other, and the associated classes
for multicounter automata, automata with multiplication, and generalized finite
automata.Comment: 14 page
Complementation of Rational sets on Scattered Linear Orderings of Finite Rank
International audienceIn a preceding paper [1], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite, and even transfinite words studied by Buchi. Kleene's theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
International audienceIn a preceding paper, automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-finite and even transfinite words studied by Buchi Kleene's theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation
Modulo Three Problem With A Cellular Automaton Solution
An important global property of a bit string is the number of ones in it. It
has been found that the parity (odd or even) of this number can be found by a
sequence of deterministic, translational invariant cellular automata with
parallel update in succession for a total of O(N^2) time. In this paper, we
discover a way to check if this number is divisible by three using the same
kind of cellular automata in O(N^3) time. We also speculate that the method
described here could be generalized to check if it is divisible by four and
other positive integers.Comment: 10 pages in revtex 4.0, using amsfont
- …