Asynchronous communicating cellular automata: formalization, robustness and equivalence

DOI10.1016/J.INS.2021.12.036MaRDI QIDQ6154787zbMATH OpenFDO

Authors

Publication date 16 February 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2021.12.036

zbMATH Keywords

asynchronous cellular automatonasynchronous communicationdistributed computingelementary cellular automatonrobustnesssimulation

Mathematics Subject Classification ID

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

Recommendations

• Delay-insensitive computation in asynchronous cellular automata
• Computation by asynchronously updating cellular automata
• Universality of Hexagonal Asynchronous Totalistic Cellular Automata
• scientific article; zbMATH DE number 2113945
• A survey on m-asynchronous cellular automata

Cites work

• (A-)synchronous (non)-deterministic cell spaces simulating each other
• A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
• A study on delay-sensitive cellular automata
• An experimental study of robustness to asynchronism for elementary cellular automata
• Asynchronism induces second-order phase transitions in elementary cellular automata
• Asynchronous game of life
• 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
• Communication Complexity
• Communication complexity and intrinsic universality in cellular automata
• Communication complexity in number-conserving and monotone cellular automata
• Communications in cellular automata
• Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
• Delay-insensitive computation in asynchronous cellular automata
• Guided tour of asynchronous cellular automata
• scientific article; zbMATH DE number 4195206 (Why is no real title available?)
• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 6255719 (Why is no real title available?)
• Invertible behavior in elementary cellular automata with memory
• Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata
• Measuring communication in automata systems (invited paper)
• On Communicating Finite-State Machines
• On the diversity of asynchronous communication
• Phase transition in elementary cellular automata with memory
• Probing robustness of cellular automata through variations of asynchronous updating
• Reversible cellular automata with memory: two-dimensional patterns from a single site seed
• Reversible computing and cellular automata -- a survey
• Synchronous to asynchronous transformation of polyautomata
• The capacity of wireless networks
• Two-dimensional cellular automata recognizer

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)