Related papers: Post-surjectivity and balancedness of cellular aut…
We produce for arbitrary non-amenable group $G$ and field $K$ a non-pre-injective, surjective linear cellular automaton. This answers positively Open Problem (OP-14) in Ceccherini-Silberstein and Coornaert's monograph "Cellular Automata and…
Gottschalk's surjunctivity conjecture states that for all group universes and finite alphabets, every equivariant and continuous selfmap of the full shift, known as cellular automaton, cannot be a strict embedding. Not all surjective…
Let $S$ be a cancellative left-amenable semigroup and let $A$ be a finite set. We prove that every pre-injective cellular automaton $\tau \colon A^S \to A^S$ is surjective.
We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When the ground field is assumed to be…
We study the class of asynchronous non-uniform cellular automata (ANUCA) over an arbitrary group universe with multiple local transition rules. We introduce the notion of stable injectivity, stable reversibility, stable post-surjectivity…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a…
This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…
Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories.
For linear non-uniform cellular automata (NUCA) over an arbitrary universe, we introduce and investigate their dual linear NUCA. Generalizing results for linear CA, we show that dynamical properties namely pre-injectivity, resp.…
We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially…
We explore the dual version of Gottschalk's conjecture recently introduced by Capobianco, Kari, and Taati, and the notion of dual surjunctivity in general. We show that dual surjunctive groups satisfy Kaplansky's direct finiteness…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity…
We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…
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…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…