Related papers: Automata as $p$-adic Dynamical Systems
We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…
In this paper we study $p$-adic dynamical systems generated by the function $f(x)={a\over x^2}$ in the set of complex $p$-adic numbers. We find an explicit formula for the $n$-fold composition of $f$ for any $n\geq 1$. Using this formula we…
We describe classes of ergodic dynamical systems for which some statistical properties are known exactly. These systems have integer dimension, are not globally dissipative, and are defined by a probability density and a two-form. This…
We show that any $(1,2)$-rational function with a unique fixed point is topologically conjugate to a $(2,2)$-rational function or to the function $f(x)={ax\over x^2+a}$. The case $(2,2)$ was studied in our previous paper, here we study the…
We describe the set of all $(3,1)$-rational functions given on the set of complex $p$-adic field $\mathbb C_p$ and having a unique fixed point. We study $p$-adic dynamical systems generated by such $(3,1)$-rational functions and show that…
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random…
We consider a family of $(2,1)$-rational functions given on the set of $p$-adic field $Q_p$. Each such function has a unique fixed point. We study ergodicity properties of the dynamical systems generated by $(2,1)$-rational functions. For…
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…
Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract…
$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…
Countable Markov shifts, denoted by $\Sigma_A$ for a 0-1 infinite matrix $A$, are central objects in symbolic dynamics and ergodic theory. R. Exel and M. Laca introduced the corresponding operator algebras, a generalization of the…
Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tasks. The boundary of the polygon obstructs both visibility…
We argue that simple dynamical systems are factors of finite automata, regarded as dynamical systems on discontinuum. We show that any homeomorphism of the real interval is of this class. An orientation preserving homeomorphism of the…
In this article, we pay attention to transitive dynamical systems having the shadowing property and the entropy functions are upper semicontinuous. As for these dynamical systems, when we consider ergodic optimization restricted on the…
Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…
For any 1-lipschitz ergodic map $F:\; \mathbb{Z}^{k}_{p} \mapsto \mathbb{Z}^{k}_{p},\;k>1\in\mathbb{N},$ there are 1-lipschitz ergodic map $G:\; \mathbb{Z}_{p} \mapsto \mathbb{Z}_{p}$ and two bijection $H_k$, $T_{k,\;P}$ that $$G = H_{k}…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…