Asynchronous communicating cellular automata: formalization, robustness and equivalence

DOI10.1016/J.INS.2021.12.036MaRDI QIDQ6154787FDOQ6154787

Authors:

Publication date: 16 February 2024

Published in: Information Sciences (Search for Journal in Brave)

simulation robustness distributed computing asynchronous communication asynchronous cellular automaton elementary cellular automaton

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

Probing robustness of cellular automata through variations of asynchronous updating
Asynchronism induces second-order phase transitions in elementary cellular automata
Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
An experimental study of robustness to asynchronism for elementary cellular automata
Communication complexity and intrinsic universality in cellular automata
Reversible computing and cellular automata -- a survey
(A-)synchronous (non)-deterministic cell spaces simulating each other
Delay-insensitive computation in asynchronous cellular automata
Asynchronous game of life
A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
On Communicating Finite-State Machines
Title not available (Why is that?)
Communication Complexity
The capacity of wireless networks
Title not available (Why is that?)
On the diversity of asynchronous communication
Title not available (Why is that?)
Synchronous to asynchronous transformation of polyautomata
Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata
Guided tour of asynchronous cellular automata
Invertible behavior in elementary cellular automata with memory
Communication complexity in number-conserving and monotone cellular automata
Two-dimensional cellular automata recognizer
Reversible cellular automata with memory: two-dimensional patterns from a single site seed
Asynchronous systems of parallel communicating finite automata
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
Characterization of random fluctuation-based computation in cellular automata
Measuring Communication in Automata Systems
Title not available (Why is that?)
Phase Transition in Elementary Cellular Automata with Memory
A study on delay-sensitive cellular automata

Cited In (1)

Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence

This page was built for publication: Asynchronous communicating cellular automata: formalization, robustness and equivalence

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