Growing patterns in 1D cellular automata
From MaRDI portal
Publication:5055892
DOI10.1007/3-540-60249-6_53OpenAlexW1511428690MaRDI QIDQ5055892FDOQ5055892
Authors:
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60249-6_53
Recommendations
Cites Work
- On the Limit Sets of Cellular Automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Title not available (Why is that?)
- Tesselations with local transformations
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Twenty Problems in the Theory of Cellular Automata
- Rice's theorem for the limit sets of cellular automata
- Condition for injectivity of global maps for tessellation automata
Cited In (5)
- Exact quantification of the complexity of spacewise pattern growth in cellular automata
- Title not available (Why is that?)
- Complete sets of initial vectors for pattern growth with elementary cellular automata
- Boundary growth in one-dimensional cellular automata
- Pattern growth in elementary cellular automata
This page was built for publication: Growing patterns in 1D cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055892)