Related papers: Automata as $p$-adic Dynamical Systems
A symmetry of a dynamical system is a map that transforms one trajectory to another trajectory. We introduce a new type of abstraction for hybrid automata based on symmetries. The abstraction combines different modes in a concrete automaton…
How do we measure genuine understanding in artificial cognitive systems? Current approaches face a measurement gap: probabilistic systems refine confidence gradually, practice-based systems compile knowledge through repeated execution, and…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
Following Schweiger's generalization of multidimensional continued fraction algorithms, we consider a very large family of $p$-adic multidimensional continued fraction algorithms, which include Schneider's algorithm, Ruban's algorithms, and…
The concept of a uniform set is introduced for an ergodic, measure-preserving transformation on a non-atomic, infinite Lebesgue space. The uniform sets exist as much as they generate the underlying $\sigma$-algebra. This leads to the result…
Finite automata are used to encode geometric figures, functions and can be used for image compression and processing. The original approach is to represent each point of a figure in $\mathbb{R}^n$ as a convolution of its $n$ coordinates…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…
We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way alternating automata with one register on infinite data words are…
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
We propose statistical systems based on $p$-adic numbers. In the systems, the Hamiltonian is a standard real number which is given by a map from the $p$-adic numbers. Therefore we can introduce the temperature as a real number and calculate…
In this paper the group structure of the $p$-adic ball and sphere are studied. The dynamical system of isometry defined on invariant sphere is investigated. We define the binary operations $\oplus$ and $\odot$ on a ball and sphere…
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…
Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…
A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…
Continued fraction expansions provide a well-established bridge between algebraic properties of numbers and combinatorics on words. In this article, we investigate the algebraicity of $p$-adic numbers whose continued fractions arise from…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
This review is devoted to dynamical systems in fields of $p$-adic numbers: origin of $p$-adic dynamics in $p$-adic theoretical physics (string theory, quantum mechanics and field theory, spin glasses), continuous dynamical systems and…