Shorter Note: The Converse of Moore's Garden-of-Eden Theorem

Cited in

(only showing first 100 items - show all)

Certain relations between properties of maps of tessellation automata
Injectivity and surjectivity of parallel maps for cellular automata
scientific article; zbMATH DE number 3487382 (Why is no real title available?)
On images of subshifts under embeddings of symbolic varieties
The Most General Conservation Law for a Cellular Automaton
Reversibility of 2D cellular automata is undecidable
Inversion of 2D cellular automata: Some complexity results
The surjectivity problem for 2D cellular automata
Bulking II: Classifications of cellular automata
Confusion in the Garden of Eden
Randomness on full shift spaces
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Dynamical behavior of additive cellular automata over finite abelian groups
On forced periodicity of perfect colorings
Statistical mechanics of surjective cellular automata
Some applications of propositional logic to cellular automata
CORRESPONDENCE BETWEEN LOCAL MAPS AND GLOBAL MAPS IN CELLULAR AUTOMATA
Moore's paradox is not just another pragmatic paradox
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
Some results about the chaotic behavior of cellular automata
Pre-expansivity in cellular automata
Hybrid one-dimensional reversible cellular automata are regular
The Garden of Eden theorem over generalized cellular automata
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
Semi-strongly irreducible shifts
Surjunctivity and reversibility of cellular automata over concrete categories
Theory of cellular automata: a survey
Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
Snakes and cellular automata: reductions and inseparability results
Reversibility and surjectivity problems of cellular automata
Groups, graphs, languages, automata, games and second-order monadic logic
The constructibility of a configuration in a cellular automaton
Equivalence of relative Gibbs and relative equilibrium measures for actions of countable amenable groups
Amenability of groups and \(G\)-sets
Growing patterns in 1D cellular automata
Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
Reversible space-time simulation of cellular automata
The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata
Induction and restriction of cellular automata
The Garden of Eden theorem for cellular automata on group sets
A garden of Eden theorem for Anosov diffeomorphisms on tori
Injectivity of cellular automata
Propagation, diffusion and randomization in cellular automata
Stable finiteness of twisted group rings and noisy linear cellular automata
Expansive actions with specification on uniform spaces, topological entropy, and the Myhill property
On behavior of two-dimensional cellular automata with an exceptional rule
The Garden-of-Eden Theorem for Finite Configurations
On invertible and stably reversible non-uniform cellular automata
Amenability of groups is characterized by Myhill's theorem
Linear cellular automata on Cayley graphs
Moore's law and the Saffman-Taylor instability
Characterization of single cycle CA and its application in pattern classification
Characterization of 1-d periodic boundary reversible CA
Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
The Myhill property for strongly irreducible subshifts over amenable groups
Characterization of Non-reachable States in Irreversible CA State Space
Three research directions in non-uniform cellular automata
Local maps inducing surjective global maps of one-dimensional tessellation automata
INJECTIVITY OF CELLULAR AUTOMATA (II)
Gardens of Eden and amenability on cellular automata
When-and how-can a cellular automaton be rewritten as a lattice gas?
A family of sand automata
Symbolic dynamics of glider guns for some one-dimensional cellular automata
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Nilpotent endomorphisms of expansive group actions
About the Garden of Eden theorems for cellular automata in the hyperbolic plane
On dual surjunctivity and applications
Amenable groups and cellular automata
Bibliography of John Myhill
On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
Surprising areas in the quest for small universal devices
Number conserving cellular automata. II: Dynamics.
Computation theoretic aspects of cellular automata
Bounds on Non-surjective Cellular Automata
Linear cellular automata over \(Z_ m\)
Reproduction in tessellation structures
Linear algebra based bounds for one-dimensional cellular automata
Intrinsic universality of a 1-dimensional reversible cellular automaton
On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties
Cellular automata and strongly irreducible shifts of finite type.
Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
The Myhill property for cellular automata on amenable semigroups
Garden of Eden and weakly periodic points for certain expansive actions of groups
Homoclinically expansive actions and a garden of Eden theorem for harmonic models
Non-uniform Cellular Automata
Garden of Eden and specification
On the hierarchy of conservation laws in a cellular automaton
A survey of cellular automata: types, dynamics, non-uniformity and applications
Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
Tesselations with local transformations
A word-counting technique for the solution of stochastic equations
Graph-theoretical characterization of invertible cellular automata
Survey of research in the theory of homogeneous structures and their applications
A characterization of cellular automata generated by idempotents on the full shift
Strong surjectivity is equivalent to C-injectivity
A tight linear bound on the synchronization delay of bijective automata
The behavioral properties of homogeneous structures
On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
A Random NP-complete problem for inversion of 2D cellular automata

This page was built for publication: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5333603)