From Multiple to Single Updates Per Cell in Elementary Cellular Automata with Neighbourhood Based Priority
- 2 July 2022
- book chapter
- Published by Springer Nature
- p. 139-157
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous updateInformation Sciences, 2019
- Shift-equivalence of k-ary, one-dimensional cellular automata rulesCommunications in Nonlinear Science and Numerical Simulation, 2018
- On the number of update digraphs and its relation with the feedback arc sets and tournamentsDiscrete Applied Mathematics, 2013
- Computation of functions on n bits by asynchronous clocking of cellular automataNatural Computing, 2013
- Combinatorics on update digraphs in Boolean networksDiscrete Applied Mathematics, 2011
- Introduction to Modeling of Complex Systems Using Cellular Automata2010
- Task‐performing dynamics in irregular, biomimetic networksComplexity, 2007
- MODELING INFECTIOUS DISEASES USING GLOBAL STOCHASTIC CELLULAR AUTOMATAJournal of Biological Systems, 2005
- Theory of cellular automata: A surveyTheoretical Computer Science, 2005
- Lattice Gas Cellular Automata and Lattice Boltzmann Models2000