Related papers: Automata as $p$-adic Dynamical Systems

We study entanglement dynamics in hybrid $\mathbb{Z}_2$-symmetric quantum automaton circuits subject to local composite measurements. We show that there exists an entanglement phase transition from a volume law phase to a critical phase by…

The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently.…

Rank one transformations serve as a source of examples in ergodic theory, showing variety of algebraic, asymptotic and spectral properties of dynamical systems. The properties of a rank one transformation are closely related to the weak…

A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a…

The $p$-adic completion $\mathbb{Q}_p$ of the rational numbers induces a different absolute value $|\cdot|_p$ than the typical $| \cdot |$ we have on the real numbers. In this paper we compare and contrast functions $f \colon \mathbb{R}^{+}…

In this paper, we investigate some ergodic properties of $Z^{2}$-actions $T_{p,n}$ generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in $Z_{m}$.

Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs (static analyses) remains a difficult and error-prone process for modern…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…

We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…

We consider a family of isometric extensions of the full shift on p symbols (for p a prime) parametrized by a probability space. Using Heath-Brown's work on the Artin conjecture, it is shown that for all but two primes p the set of limit…

We study the rich behavior of ergodicity and conservativity of Cartesian products of infinite measure preserving transformations. A class of transformations is constructed such that for any subset $R\subset \mathbb Q\cap (0,1)$ there exists…

We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite…

Given a string $P$ of length $m$ over an alphabet $\Sigma$ of size $\sigma$, a swapped version of $P$ is a string derived from $P$ by a series of local swaps, i.e., swaps of adjacent symbols, such that each symbol can participate in at most…

We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

We consider $(1,2)$-rational functions given on the field of $p$-adic numbers $\mathbb Q_p$. In general, such a function has four parameters. We study the case when such a function has two fixed points and show that when there are two fixed…

Imagine an assembly line where a box with a lid and liquid in it enters in some unknown orientation. The box should leave the line with the open lid facing upwards with the liquid still in it. To save costs there are no complex sensors or…