From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
From MaRDI portal
Publication:2086703
Cites work
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- An experimental study of robustness to asynchronism for elementary cellular automata
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- Combinatorics and number theory of counting sequences
- Combinatorics on update digraphs in Boolean networks
- Computation of functions on n bits by asynchronous clocking of cellular automata
- Guided tour of asynchronous cellular automata
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 726524 (Why is no real title available?)
- Lattice-gas cellular automata and lattice Boltzmann models. An introduction
- MODELING INFECTIOUS DISEASES USING GLOBAL STOCHASTIC CELLULAR AUTOMATA
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules
- Simulating complex systems by cellular automata.
- Theory of cellular automata: a survey
Cited in
(2)
This page was built for publication: From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086703)
