3,558 research outputs found

    The Magic Number Problem for Subregular Language Families

    Full text link
    We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified. We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist. For finite languages we obtain some partial results showing that certain numbers are non-magic.Comment: In Proceedings DCFS 2010, arXiv:1008.127

    Dimension minimization of a quantum automaton

    Full text link
    A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and dechorence. The linearity of a QA and of the partial trace super-operator, combined with the properties of invariant subspaces under unitary transformations, are used to minimize the dimension of the automaton and, consequently, the number of its working qubits. The results here developed are valid wether the state set of the QA is finite or not. There are two main results in this paper: 1) We show that the dimension reduction is possible whenever the unitary transformations, associated to each letter of the input alphabet, obey a set of conditions. 2) We develop an algorithm to find out the equivalent minimal QA and prove that its complexity is polynomial in its dimension and in the size of the input alphabet.Comment: 26 page

    A Quasi-Linear Time Algorithm Deciding Whether Weak B\"uchi Automata Reading Vectors of Reals Recognize Saturated Languages

    Full text link
    This work considers weak deterministic B\"uchi automata reading encodings of non-negative dd-vectors of reals in a fixed base. A saturated language is a language which contains all encoding of elements belonging to a set of dd-vectors of reals. A Real Vector Automaton is an automaton which recognizes a saturated language. It is explained how to decide in quasi-linear time whether a minimal weak deterministic B\"uchi automaton is a Real Vector Automaton. The problem is solved both for the two standard encodings of vectors of numbers: the sequential encoding and the parallel encoding. This algorithm runs in linear time for minimal weak B\"uchi automata accepting set of reals. Finally, the same problem is also solved for parallel encoding of automata reading vectors of relative reals

    Learn with SAT to Minimize B\"uchi Automata

    Full text link
    We describe a minimization procedure for nondeterministic B\"uchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an instance of a generic learning algorithm based on a "minimally adequate teacher" in the sense of Angluin. We use a SAT solver to find an NBA for given sets of positive and negative examples. We use complementation via construction of deterministic parity automata to check candidates computed in this manner for equivalence with A. Failure of equivalence yields new positive or negative examples. Our method proved successful on complete samplings of small automata and of quite some examples of bigger automata. We successfully ran the minimization on over ten thousand automata with mostly up to ten states, including the complements of all possible automata with two states and alphabet size three and discuss results and runtimes; single examples had over 100 states.Comment: In Proceedings GandALF 2012, arXiv:1210.202

    Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages

    Get PDF
    We study the state complexity of binary operations on regular languages over different alphabets. It is known that if LmL'_m and LnL_n are languages of state complexities mm and nn, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on LmL'_m and LnL_n is mnmn, and that of product (concatenation) is m2n2n1m 2^n - 2^{n-1}. In contrast to this, we show that if LmL'_m and LnL_n are over different alphabets, the state complexity of union and symmetric difference is (m+1)(n+1)(m+1)(n+1), that of difference is mn+mmn+m, that of intersection is mnmn, and that of product is m2n+2n1m2^n+2^{n-1}. We also study unrestricted complexity of binary operations in the classes of regular right, left, and two-sided ideals, and derive tight upper bounds. The bounds for product of the unrestricted cases (with the bounds for the restricted cases in parentheses) are as follows: right ideals m+2n2+2n1m+2^{n-2}+2^{n-1} (m+2n2m+2^{n-2}); left ideals mn+m+nmn+m+n (m+n1m+n-1); two-sided ideals m+2nm+2n (m+n1m+n-1). The state complexities of boolean operations on all three types of ideals are the same as those of arbitrary regular languages, whereas that is not the case if the alphabets of the arguments are the same. Finally, we update the known results about most complex regular, right-ideal, left-ideal, and two-sided-ideal languages to include the unrestricted cases.Comment: 30 pages, 15 figures. This paper is a revised and expanded version of the DCFS 2016 conference paper, also posted previously as arXiv:1602.01387v3. The expanded version has appeared in J. Autom. Lang. Comb. 22 (1-3), 29-59, 2017, the issue of selected papers from DCFS 2016. This version corrects the proof of distinguishability of states in the difference operation on p. 12 in arXiv:1609.04439v

    From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity

    Full text link
    The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. We also briefly recall the known bounds for the removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free nondeterministic devices. Moreover, we report on recent results on the average case descriptional complexity bounds for the conversion of regular expressions to finite automata and brand new developments on the state elimination algorithm that converts finite automata to regular expressions.Comment: In Proceedings AFL 2014, arXiv:1405.527
    corecore