From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
From MaRDI portal
Publication:2086703
DOI10.1007/978-3-031-03986-7_6OpenAlexW4285255886MaRDI QIDQ2086703
Eurico L. P. Ruivo, Thiago de Mattos, Pedro Paulo Balbi
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-03986-7_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
- Combinatorics on update digraphs in Boolean networks
- Simulating complex systems by cellular automata.
- Theory of cellular automata: a survey
- Lattice-gas cellular automata and lattice Boltzmann models. An introduction
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Combinatorics and Number Theory of Counting Sequences
- MODELING INFECTIOUS DISEASES USING GLOBAL STOCHASTIC CELLULAR AUTOMATA
This page was built for publication: From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
