Asynchronous communicating cellular automata: formalization, robustness and equivalence

DOI10.1016/j.ins.2021.12.036MaRDI QIDQ6154787

No author found.

Publication date: 16 February 2024

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

zbMATH Keywords

robustnesssimulationdistributed computingasynchronous communicationasynchronous cellular automatonelementary cellular automaton

Mathematics Subject Classification ID

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

Cites Work

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

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