A guided tour of asynchronous cellular automata

DOI10.1007/978-3-642-40867-0_2MaRDI QIDQ2851298zbMATH OpenOpenAlexFDO

Authors Nazim Fatès

Publication date 10 October 2013

Published in Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40867-0_2

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Cellular automata (computational aspects) (68Q80)

Recommendations

• Guided tour of asynchronous cellular automata
• A survey on \(m\)-asynchronous cellular automata
• Foreword: Asynchronous cellular automata and applications
• Computing issues of asynchronous CA
• Asynchronous cellular automata and dynamical properties

Cited in

(22)

• Asynchronous cellular learning automata
• Foreword: Asynchronous cellular automata and applications
• Characterization of random fluctuation-based computation in cellular automata
• Supercritical probabilistic cellular automata: how effective is the synchronous updating?
• Overview: PCA models and issues
• A max-plus model of asynchronous cellular automata
• Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update
• ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
• Computational aspects of asynchronous cellular automata
• Guided tour of asynchronous cellular automata
• Building squares with optimal state complexity in restricted active self-assembly
• A survey on \(m\)-asynchronous cellular automata
• Land use and land cover change simulation enhanced by asynchronous communicating cellular automata
• Computing issues of asynchronous CA
• Foreword: asynchronous behavior of cellular automata and discrete models
• A note on the classification of the most simple asynchronous cellular automata
• Realization problems for nonuniform cellular automata
• Asynchronous cellular automata and dynamical properties
• Foreword: Asynchronous cellular automata and nature-inspired computation
• Turing-completeness of asynchronous non-camouflage cellular automata
• Asynchronous, finite dynamical systems
• Fixing monotone Boolean networks asynchronously

This page was built for publication: A guided tour of asynchronous cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851298)