Related papers: Automata as $p$-adic Dynamical Systems
The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very…
Real-world computers have operational constraints that cause nonzero entropy production (EP). In particular, almost all real-world computers are ``periodic'', iteratively undergoing the same physical process; and ``local", in that…
A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are read,…
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 periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
We generalize the greedy and lazy $\beta$-transformations for a real base $\beta$ to the setting of alternate bases $\boldsymbol{\beta}=(\beta_0,\ldots,\beta_{p-1})$, which were recently introduced by the first and second authors as a…
In this paper we study a class of \emph{self-consistent dynamical systems}, self-consistent in the sense that the discrete time dynamics is different in each step depending on current statistics. The general framework admits popular…
This paper considers a class C(Z_p) of closed sets of the p-adic integers obtained by graph-directed constructions analogous to those of Mauldin and Williams over the real numbers. These sets are characterized as collections of those p-adic…
We study measures that are obtained as push-forwards of measures of maximal entropy on sofic shifts under digital maps $(x_k)_{k\in\mathbb{N}}\mapsto\sum_{k\in\mathbb{N}}x_k\beta^{-k}$, where $\beta>1$ is a Pisot number. We characterise the…
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…
This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending the notion of continued fraction to the $p$-adic fields, one…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
In this paper we study the ergodic theory of a class of symbolic dynamical systems $(\O, T, \mu)$ where $T:{\O}\to \O$ the left shift transformation on $\O=\prod_0^\infty\{0,1\}$ and $\mu$ is a $\s$-finite $T$-invariant measure having the…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
This paper contains two parts. In the first part, we study the ergodicity of periodic measures of random dynamical systems on a separable Banach space. We obtain that the periodic measure of the continuous time skew-product dynamical system…
We proved that for the countably infinite number of one-parameterized one dimensional dynamical systems, they preserve the Lebesgue measure and they are ergodic for the measure (infinite ergodicity). Considered systems connect the parameter…
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…
An automaton is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the \v{C}ern\'y conjecture, one of the oldest and most…
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems. In DIOA, automata can be created and destroyed dynamically, as computation proceeds, and an automaton can dynamically change its signature, i.e., the set of…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…