Related papers: Automata as $p$-adic Dynamical Systems
An (asynchronous) automaton transformation of one-sided infinite words over p-letter alphabet Fp = Z/pZ, where p is a prime, is a continuous transformation (w.r.t. the p-adic metric) of the ring of p-adic integers Zp. Moreover, an automaton…
In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…
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…
Many sequences of $p$-adic integers project modulo $p^\alpha$ to $p$-automatic sequences for every $\alpha \geq 0$. Examples include algebraic sequences of integers, which satisfy this property for every prime $p$, and some cocycle…
This paper is devoted to the problem of ergodicity of $p$-adic dynamical systems. Our aim is to present criteria of ergodicity in terms of coordinate functions corresponding to digits in the canonical expansion of $p$-adic numbers. The…
Monomial mappings, $x\mapsto x^n$, are topologically transitive and ergodic with respect to Haar measure on the unit circle in the complex plane. In this paper we obtain an anologous result for monomial dynamical systems over $p-$adic…
The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…
We prove that every probabilistic cellular automaton with strictly positive transition probabilities that admits a stationary Bernoulli measure is exponentially ergodic. Moreover, the mixing time of any finite region in such a system is…
In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…
This paper is devoted to (discrete) $p$-adic dynamical systems, an important domain of algebraic and arithmetic dynamics. We consider the following open problem from theory of $p$-adic dynamical systems. Given continuous function $f:Z_p >…
Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
Let $\mathcal L_1$ be the set of all mappings $f\colon\Z_p\Z_p$ of the space of all $p$-adic integers $\Z_p$ into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping $f\in\mathcal L_1$ is ergodic with…
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 a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…
Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…
We present a theoretical framework for the compression of automata, which are widely used in speech processing and other natural language processing tasks. The framework extends to graph compression. Similar to stationary ergodic processes,…
While routinely used in other areas of dynamics, image sets are ill-defined objects in general non-invertible measurable dynamics. We propose a way of consistently working with image sets of null-preserving (and hence, in particular, of…