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

From MaRDI portal
Publication:5333603

DOI10.2307/2034301zbMath0126.32501OpenAlexW2079544905WikidataQ55953566 ScholiaQ55953566MaRDI QIDQ5333603

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




Related Items (97)

Cellular automata and strongly irreducible shifts of finite type.INJECTIVITY OF CELLULAR AUTOMATA (II)Semi-strongly irreducible shiftsIntrinsic universality of a 1-dimensional reversible Cellular AutomatonInversion of 2D cellular automata: Some complexity resultsThe surjectivity problem for 2D cellular automataA tight linear bound on the synchronization delay of bijective automataGrowing patterns in 1D cellular automataGardens of Eden and amenability on cellular automataA Characterization of Cellular Automata Generated by Idempotents on the Full ShiftA garden of Eden theorem for Anosov diffeomorphisms on toriBounds on Non-surjective Cellular AutomataPropagation, Diffusion and Randomization in Cellular AutomataSymbolic dynamics of glider guns for some one-dimensional cellular automataThe Garden of Eden Theorem for Cellular Automata on Group SetsMultidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issuesReversible cellular automaton able to simulate any other reversible one using partitioning automataStatistical mechanics of surjective cellular automataHomoclinically expansive actions and a garden of Eden theorem for harmonic modelsDecidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryptionOn the Garden of Eden theorem for endomorphisms of symbolic algebraic varietiesThe Most General Conservation Law for a Cellular AutomatonGarden of Eden and weakly periodic points for certain expansive actions of groupsNumber conserving cellular automata. II: Dynamics.A survey of cellular automata: types, dynamics, non-uniformity and applicationsEffective Projections on Group Shifts to Decide Properties of Group Cellular AutomataSimulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata LeverageOn sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groupsCORRESPONDENCE BETWEEN LOCAL MAPS AND GLOBAL MAPS IN CELLULAR AUTOMATAOn forced periodicity of perfect coloringsOn images of subshifts under embeddings of symbolic varietiesOn invertible and stably reversible non-uniform cellular automataGroups, graphs, languages, automata, games and second-order monadic logicStrong surjectivity is equivalent to C-injectivityUniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphsAmenability of Groups and G-SetsCharacterization of Non-reachable States in Irreversible CA State SpaceThree research directions in non-uniform cellular automataThe Myhill property for strongly irreducible subshifts over amenable groupsA family of sand automataThe Garden-of-Eden Theorem for Finite ConfigurationsHybrid one-dimensional reversible cellular automata are regularA Random NP-complete problem for inversion of 2D cellular automataSnakes and Cellular Automata: Reductions and Inseparability ResultsBibliography of John MyhillSurjunctivity and Reversibility of Cellular Automata over Concrete CategoriesDynamical behavior of additive cellular automata over finite abelian groupsOn the hierarchy of conservation laws in a cellular automatonThe Moore-Myhill pseudo tiling for the Heisenberg tessellation automataLinear cellular automata on Cayley graphsSurvey of research in the theory of homogeneous structures and their applicationsBulking II: Classifications of cellular automataReproduction in tessellation structuresThe behavioral properties of homogeneous structuresTheory of cellular automata: a surveyLinear Algebra Based Bounds for One-Dimensional Cellular AutomataCertain relations between properties of maps of tessellation automataLocal maps inducing surjective global maps of one-dimensional tessellation automataNon-uniform Cellular AutomataExpansive actions with specification on uniform spaces, topological entropy, and the Myhill propertyWhen-and how-can a cellular automaton be rewritten as a lattice gas?On behavior of two-dimensional cellular automata with an exceptional ruleInduction and restriction of cellular automataInjectivity and surjectivity of parallel maps for cellular automataAbout the Garden of Eden Theorems for Cellular Automata in the Hyperbolic PlaneCharacterization of Single Cycle CA and its Application in Pattern ClassificationCharacterization of 1-d Periodic Boundary Reversible CAPre-expansivity in cellular automataA completeness problem for pattern generation in tessellation automataAdditive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic PropertiesThe constructibility of a configuration in a cellular automatonINJECTIVITY OF CELLULAR AUTOMATASurprising Areas in the Quest for Small Universal DevicesTessellation structures for reproduction of arbitrary patternsConfusion in the Garden of EdenSome applications of propositional logic to cellular automataGarden of Eden and specificationTesselations with local transformationsAmenable groups and cellular automataNilpotent endomorphisms of expansive group actionsThe Myhill property for cellular automata on amenable semigroupsOn the induction operation for shift subspaces and cellular automata as presentations of dynamical systemsAmenability of groups is characterized by Myhill's theoremNonconstructible blocks in 1D cellular automata: minimal generators and natural systemsA word-counting technique for the solution of stochastic equationsGraph-theoretical characterization of invertible cellular automataReversible space-time simulation of cellular automataUnnamed ItemLinear cellular automata over \(Z_ m\)On dual surjunctivity and applicationsInverse and Injectivity of Parallel Relations Induced by Cellular AutomataEquivalence of relative Gibbs and relative equilibrium measures for actions of countable amenable groupsComputation theoretic aspects of cellular automataReversibility of 2D cellular automata is undecidableReversibility and surjectivity problems of cellular automataRandomness on full shift spacesSome results about the chaotic behavior of cellular automata




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