Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
From MaRDI portal
Publication:5333603
DOI10.2307/2034301zbMATH Open0126.32501OpenAlexW2079544905WikidataQ55953566 ScholiaQ55953566MaRDI QIDQ5333603FDOQ5333603
Authors: John Myhill 
Publication date: 1963
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2034301
Cited In (only showing first 100 items - show all)
- The Most General Conservation Law for a Cellular Automaton
- Reversibility of 2D cellular automata is undecidable
- Confusion in the Garden of Eden
- Inversion of 2D cellular automata: Some complexity results
- The surjectivity problem for 2D cellular automata
- Bulking II: Classifications of cellular automata
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- On forced periodicity of perfect colorings
- Statistical mechanics of surjective cellular automata
- Moore's paradox is not just another pragmatic paradox
- Some results about the chaotic behavior of cellular automata
- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- Surjunctivity and reversibility of cellular automata over concrete categories
- Semi-strongly irreducible shifts
- Snakes and cellular automata: reductions and inseparability results
- Theory of cellular automata: a survey
- Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
- Reversibility and surjectivity problems of cellular automata
- The constructibility of a configuration in a cellular automaton
- Groups, graphs, languages, automata, games and second-order monadic logic
- Growing patterns in 1D cellular automata
- Reversible space-time simulation of cellular automata
- Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
- Induction and restriction of cellular automata
- Propagation, diffusion and randomization in cellular automata
- A garden of Eden theorem for Anosov diffeomorphisms on tori
- The Garden-of-Eden Theorem for Finite Configurations
- Linear cellular automata on Cayley graphs
- On invertible and stably reversible non-uniform cellular automata
- On behavior of two-dimensional cellular automata with an exceptional rule
- Moore's law and the Saffman-Taylor instability
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- The Myhill property for strongly irreducible subshifts over amenable groups
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- Three research directions in non-uniform cellular automata
- 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
- Nilpotent endomorphisms of expansive group actions
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- Amenable groups and cellular automata
- Bibliography of John Myhill
- Surprising areas in the quest for small universal devices
- Number conserving cellular automata. II: Dynamics.
- Linear algebra based bounds for one-dimensional cellular automata
- Computation theoretic aspects of cellular automata
- Linear cellular automata over \(Z_ m\)
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Reproduction in tessellation structures
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- The Myhill property for cellular automata on amenable semigroups
- Cellular automata and strongly irreducible shifts of finite type.
- Non-uniform Cellular Automata
- On the hierarchy of conservation laws in a cellular automaton
- Tesselations with local transformations
- A word-counting technique for the solution of stochastic equations
- Survey of research in the theory of homogeneous structures and their applications
- A characterization of cellular automata generated by idempotents on the full shift
- A tight linear bound on the synchronization delay of bijective automata
- Strong surjectivity is equivalent to C-injectivity
- The behavioral properties of homogeneous structures
- A completeness problem for pattern generation in tessellation automata
- Tessellation structures for reproduction of arbitrary patterns
- A Random NP-complete problem for inversion of 2D cellular automata
- Certain relations between properties of maps of tessellation automata
- Injectivity and surjectivity of parallel maps for cellular automata
- Title not available (Why is that?)
- On images of subshifts under embeddings of symbolic varieties
- Randomness on full shift spaces
- Dynamical behavior of additive cellular automata over finite abelian groups
- CORRESPONDENCE BETWEEN LOCAL MAPS AND GLOBAL MAPS IN CELLULAR AUTOMATA
- Some applications of propositional logic to cellular automata
- Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
- Pre-expansivity in cellular automata
- The Garden of Eden theorem over generalized cellular automata
- Hybrid one-dimensional reversible cellular automata are regular
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Equivalence of relative Gibbs and relative equilibrium measures for actions of countable amenable groups
- Amenability of groups and \(G\)-sets
- The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata
- The Garden of Eden theorem for cellular automata on group sets
- Injectivity of 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
- Amenability of groups is characterized by Myhill's theorem
- Characterization of single cycle CA and its application in pattern classification
- Characterization of 1-d periodic boundary reversible CA
- Characterization of Non-reachable States in Irreversible CA State Space
- INJECTIVITY OF CELLULAR AUTOMATA (II)
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- About the Garden of Eden theorems for cellular automata in the hyperbolic plane
- On dual surjunctivity and applications
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- Bounds on Non-surjective Cellular Automata
- Garden of Eden and weakly periodic points for certain expansive actions of groups
- On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties
- Garden of Eden and specification
- Homoclinically expansive actions and a garden of Eden theorem for harmonic models
- 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
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)
