Changing the Neighborhood of Cellular Automata
From MaRDI portal
Publication:3608488
DOI10.1007/978-3-540-74593-8_22zbMATH Open1211.68263OpenAlexW1539569083MaRDI QIDQ3608488FDOQ3608488
Authors: Hidenosuke Nishio
Publication date: 5 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74593-8_22
Recommendations
- Changing the neighborhood of cellular automata: local structure, equivalence and isomorphism
- A generalized neighborhood for cellular automata
- A NEIGHBORHOOD SELECTION METHOD FOR CELLULAR AUTOMATA MODELS
- Two-dimensional cellular automata and their neighborhoods
- STACS 2005
- Cellular automata: Real-time equivalence between one-dimensional neighborhoods
- Alternation on cellular automata
- scientific article; zbMATH DE number 852846
- scientific article; zbMATH DE number 2219494
- Edge of chaos in rule-changing cellular automata
Cited In (4)
- Changing the neighborhood of cellular automata: local structure, equivalence and isomorphism
- How Does the Neighborhood Affect the Global Behavior of Cellular Automata?
- Achieving universality of CA by changing the neighborhood
- Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality
This page was built for publication: Changing the Neighborhood of Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608488)