The Garden of Eden theorem over generalized cellular automata
From MaRDI portal
Publication:6587091
DOI10.1007/S40840-024-01719-YMaRDI QIDQ6587091FDOQ6587091
Authors: Xiaojun Huang, Qin Zhang 
Publication date: 13 August 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Recommendations
- On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
- On the Garden of Eden theorem for non-uniform cellular automata
- On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties
- Surjective cellular automata far from the Garden of Eden
- The Garden of Eden theorem for cellular automata on group sets
Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)
Cites Work
- An Introduction to Symbolic Dynamics and Coding
- Amenable groups and cellular automata
- Cellular automata and groups
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Gardens of Eden and amenability on cellular automata
- A generalization of cellular automata over groups
- Amenability of groups is characterized by Myhill's theorem
This page was built for publication: The Garden of Eden theorem over generalized cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587091)
