Related papers: Retractable state-finite automata without outputs
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
This paper treats the global stabilization problem of continuous-time switched affine systems that have rank-deficient convex combinations of their dynamic matrices. For these systems, the already known set of attainable equilibrium points…
We present a finite-state, deterministic automaton that emulates the Collatz function through digitwise transitions on base-10 representations. Each digit is represented as a symbolic triplet (r, p, c) encoding its value, the parity of the…
In this paper we use an affine connection formulation to study an optimal control problem for a class of nonholonomic, under-actuated mechanical systems. In particular, we aim at minimizing the norm-squared of the control input to move the…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the…
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided by this theory, we propose automata cascades as a structured, modular, way to describe automata as…
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…
Recent analysis of classical algorithms resulted in their axiomatization as transition systems satisfying some simple postulates, and in the formulation of the Abstract State Machine Theorem, which assures us that any classical algorithm…
The asynchronous systems are non-deterministic real time, binary valued models of the asynchronous circuits from electronics. Autonomy means that there is no input and regularity means analogies with the (real) dynamical systems. We…
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path…
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given…
Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…
We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…
The transition structure of an automaton can be used to create a natural topology to the set of states of an automaton, generating, this way, a topological space. Probabilistic automata can also be modeled in terms of measure theory. A…
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
We define fully irreducible automorphisms of generalized Baumslag-Solitar groups in analogy with fully irreducible automorphisms of free groups. We first obtain a characterization of fully irreducible automorphisms analogous to a condition…