相关论文: Finite entropy for multidimensional cellular autom…
Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 12 rules in 3-state CA and 118320 rules…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…
Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…
In this paper, we determine the topological entropy $h(\phi)$ of a continuous endomorphism $\phi$ of a Lie group $G$. This computation is a classical topic in ergodic theory which seemed to have long been solved. But, when $G$ is…
Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that…
We consider partially hyperbolic diffeomorphisms $f$ with a one-dimensional central direction such that the unstable entropy exceeds the stable entropy. Our main result proves that such maps have a finite number of ergodic measures of…
In a previous paper ("A characterization of topologically completely positive entropy for shifts of finite type"), the author gave a characterization for when a $\mathbb{Z}^d$-shift of finite type (SFT) has no nontrivial subshift factors…
Using an unusual, yet natural invariant measure we show that there exists a sensitive cellular automaton whose perturbations propagate at asymptotically null speed for almost all configurations. More specifically, we prove that Lyapunov…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…
We give a "limit-free formula" simplifying the computation of the topological entropy for topological automorphisms of totally disconnected locally compact groups. This result allows us to extend several basic properties of the topological…
The topological entropy of a continuous self-map of a compact metric space can be defined in several distinct ways; when the space is not assumed compact, these definitions can lead to distinct invariants. The original, purely topological…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
Let $G$ be a topological group, let $\phi$ be a continuous endomorphism of $G$ and let $H$ be a closed $\phi$-invariant subgroup of $G$. We study whether the topological entropy is an additive invariant, that is,…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…