Related papers: On Basic Properties of Jumping Finite Automata

The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.

Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of free monoids. As a generalization of Turakainen's result, it…

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…

In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…

We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both…

In this work we prove decidability of the model-checking problem for safe recursion schemes against properties defined by alternating B-automata. We then exploit this result to show how to compute downward closures of languages of finite…

We examine the behaviors of various models of $k$-limited automata, which naturally extend Hibbard's [Inf. Control, vol. 11, pp. 196--238, 1967] scan limited automata, each of which is a single-tape linear-bounded automaton satisfying the…

We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines.…

This paper introduces a new algorithm for the induction if complex finite state automata from samples of behavior. The algorithm is based on information theoretic principles. The algorithm reduces the search space by many orders of…

A freely falling chain from a cup at certain height can jump. The process can be divided into two parts: a stable suspension and an accelerating procedure. Variational principle and force analysis demonstrate that the shape of stable…

We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for such an automaton in order to accept an input. The model…

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…

Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…

We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and…

We give an automata-theoretic description of the algebraic closure of the rational function field F_q(t) over a finite field, generalizing a result of Christol. The description takes place within the Hahn-Mal'cev-Neumann field of…

In the literature, there exist several interesting hybrid models of finite automata which have both quantum and classical states. We call them semi-quantum automata. In this paper, we compare the descriptional power of these models with…

This paper is a survey of extensions to finite automata theory to model real-time systems as well as systems exhibiting mixed discrete-continuous behavior. Real-time systems maintain a continuous and timely interaction with the environment,…

In this paper, we study some large scale properties of the mother groups of bounded automata groups. First we give two methods to prove every mother group has infinite asymptotic dimension. Then we study the decomposition complexity of…

We investigate the continuity of the \omega-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous \omega-function definable by some WFA…