相关论文: The Garden of Eden Theorem for Cellular Automata o…

We prove the Moore and the Myhill property for strongly irreducible subshifts over right amenable and finitely right generated left homogeneous spaces with finite stabilisers. Both properties together mean that the global transition…

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…

Let $G$ be an amenable group and let $V$ be a finite-dimensional vector space over an arbitrary field $\K$. We prove that if $X \subset V^G$ is a strongly irreducible linear subshift of finite type and $\tau \colon X \to X$ is a linear…

We establish a Garden of Eden theorem for expansive algebraic actions of amenable groups with the weak specification property, i.e. for any continuous equivariant map T from the underlying space to itself, T is pre-injective if and only if…

Let $G$ be an amenable group and let $X$ be an irreducible complete algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $X$ and let $\tau \colon A^G \to A^G$ be an algebraic cellular automaton…

Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases…

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that…

Suppose $\tau$ is a cellular automaton over an amenable group and a finite alphabet. Celebrated Garden of Eden theorem states, that pre-injectivity of $\tau$ is equivalent to non-existence of Garden of Eden configuration. In this paper we…

We prove that on B-free subshifts, with B satisfying the Erd\"os condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.

Let $\Gamma$ be a countable abelian group and $f \in \Z[\Gamma]$, where $\Z[\Gamma]$ denotes the integral group ring of $\Gamma$. Consider the Pontryagin dual $X_f$ of the cyclic $\Z[\Gamma]$-module $\Z[\Gamma]/\Z[\Gamma] f$ and suppose…

Non-uniform cellular automata (NUCA) are an extension of cellular automata with multiple local rules in different cells. We show that if the distribution of local rules is uniformly recurrent, or recurrent in the one-dimensional case, the…

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.…

We review topics in the theory of cellular automata and dynamical systems that are related to the Moore-Myhill Garden of Eden theorem.

Let $G$ be a group. Let $X$ be an algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of rational points of $X$. We study algebraic group cellular automata $\tau \colon A^G \to A^G$ whose local defining map is…

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…

Garden of Eden (GOE) states in cellular automata are grid configurations which have no precursors, that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest…

We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…

Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…

Let $\Gamma$ be a countable Abelian group and $f \in \Z[\Gamma]$, where $\Z[\Gamma]$ denotes the integral group ring of $\Gamma$. Consider the Pontryagin dual $X_f$ of the cyclic $\Z[\Gamma]$-module $\Z[\Gamma]/\Z[\Gamma] f$ and suppose…

Autonomous threshold element circuit networks are used to investigate the structure of neural networks. With these circuits, as the transition functions are threshold functions, it is necessary to consider the existence of sequences of…