Minimal Deterministic Automaton Research Articles

Minimal automation for a factorial, transitive, and rational language

We prove that every FTR-language R (factorial, transitive, rational) admits a minimal irreducible deterministic automaton. This automaton can be computed in three different ways. First, it admits an intrinsic definition depending only on the syntactic monoid of the language R. Secondly, it is a quotient for a simple equivalence relation of every irreducible deterministic automaton recognizing R. Thirdly, it is a subautomaton of the classical minimal deterministic automaton associated with R, computable with a simple algorithm.

The solutions of two star-height problems for regular trees

Regular trees can be defined by two types of rational expressions. For these two types we solve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automation for regular languages). In one case, the minimal starheight is the rank (in the sense of Eggan) of the minimal graph. There corresponds a characterization of the star-height of a prefix-free regular language w.r.t. rational expressions of a special kind (called deterministic) as the rank of its minimal deterministic automaton considered as a graph.

Probabilistic automata

Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the formulation of finite automata in Rabin and Scott (1959) where the automata %plane1D;504; have two-valued output and thus can be viewed as defining the set T ( %plane1D;504; ) of all tapes accepted by %plane1D;504; . This involves no loss of generality. A p.a. is an automaton which, when in state s and when input is σ, has a probability p i (s, σ)} of going into any state s i . With any cut-point 0 ≤ λ < 1, there is associated the set T ( %plane1D;504; , λ ) of tapes accepted by %plane1D;504; with cut-point λ . Here we develop a general theory of p.a. and solve some of the basic problems. Aside from the mathematical interest in pursuing this natural generalization of finite automata, the results also bear on questions of reliability of sequential circuits. P.a. are, in general, stronger than deterministic automata (Theorem 2). By studying the way we may want to use p.a. we are led to introduce the concept of isolated cut-point . It turns out that every p.a. with isolated cut-point is equivalent to a suitable deterministic automaton (the Reduction Theorem 3). It is interesting to note that in passing from a minimal deterministic automaton to an equivalent p.a. we can sometimes save states (Section VII). The Reduction Theorem is applied to prove the existence of an approximate calculation procedure for a calculation problem involving products of stochastic matrices (Section VIII). The problem is of a new kind in that there is no a-priori bound on the number of operations (matrix multiplications) which we may have to perform and therefore classical numerical estimates of round-off errors do not apply. Actual automata (Definition 9) have the property, often existing in actual unreliable circuits, that all transition probabilities are strictly positive. Actual automata are proved to give only definite events. This points to the restrictions we may have to impose on a probabilistic sequential circuit if we want it to perform general tasks, namely, some transitions should be prohibited. Finally we treat the important problem of stability. Is the operation of a p.a. stable (unchanged) under small enough perturbations of the transition probabilities? We have an affirmative answer to this question in the case of actual automata (Theorem 11) and we discuss the problem for the general case.