Simulating complex systems by cellular automata.
From MaRDI portal
Cited in
(16)- Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
- On the complexity of asynchronous freezing cellular automata
- From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- scientific article; zbMATH DE number 5074154 (Why is no real title available?)
- scientific article; zbMATH DE number 5469853 (Why is no real title available?)
- CELLULAR AUTOMATA AND LATTICE BOLTZMANN TECHNIQUES: AN APPROACH TO MODEL AND SIMULATE COMPLEX SYSTEMS
- Overview: PCA models and issues
- A method for construction of cellular automata simulating pattern formation processes
- scientific article; zbMATH DE number 7310073 (Why is no real title available?)
- CONSTRUCTION OF INHOMOGENEOUS 3D MESH FOR SIMULATION OF BACTERIAL CELL GROWTH AND DIVISION BY CELLULAR AUTOMATA
- Quantitative comparison between crowd models for evacuation planning and evaluation
- BUILDING EFFICIENT COMPUTATIONAL CELLULAR AUTOMATA MODELS OF COMPLEX SYSTEMS: BACKGROUND, APPLICATIONS, RESULTS, SOFTWARE, AND PATHOLOGIES
- A sequential solution to the density classification task using an intermediate alphabet
- Fast solutions to k-parity and k-synchronisation using parallel automata networks
- Grid anisotropy of propagation fronts in cellular automata and its reduction methods
This page was built for publication: Simulating complex systems by cellular automata.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983130)
