Related papers: On Basic Properties of Jumping Finite Automata
We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…
In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level,…
This is a survey on upper and lower bounds for finite group actions on bounded surfaces, 3-dimensional handlebodies and closed handles, handlebodies in arbitrary dimensions and finite graphs (the common feature of these objects is that all…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and…
In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
Higher-dimensional automata constitute a very expressive model for concurrent systems. In this paper, we discuss "topological abstraction" of higher-dimensional automata, i.e., the replacement of HDAs by smaller ones that can be considered…
We survey results in the literature that establish the \v{C}ern\'y conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a quadratic (in the number of states) upper bound on the…
In the literature, there exist several quantum finite automata (QFA) models with both quantum and classical states. These models are of particular interest,as they show praiseworthy advantages over the fully quantum models in some…
We introduce asymptotically rigid mapping class groups of handlebodies and determine their finiteness properties, which vary depending on the space of ends of the underlying handlebody. As it turns out, in some cases, the homology of these…
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock…
In the paper we develop the $p$-adic theory of discrete automata. Every automaton $\mathfrak A$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic…
Herein we survey the main results concerning quantum automata and machines with classical control. These machines were originally proposed by Sernadas et al in [37], during the FCT QuantLog project. First, we focus on the expressivity of…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To…
We present a correspondence and bisimulation between variants of parametrically polymorphic type systems and variants of finite control automata, such as FSA, PDA, tree automata and Turing machine. Within this correspondence we show that…
Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by S\'enizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent…