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

DOI10.1016/j.tcs.2024.114721MaRDI QIDQ6590088

Sukanta Das, Nazim Fatès, Souvik Roy

Publication date: 21 August 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Markov chainsrecurrenceasynchronous updating

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probing robustness of cellular automata through variations of asynchronous updating
• Computational complexity of finite asynchronous cellular automata
• Dynamics groups of asynchronous cellular automata
• Computation and construction universality of reversible cellular automata
• A study on delay-sensitive cellular automata
• Fully asynchronous behavior of double-quiescent elementary cellular automata
• Tesselations with local transformations
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• On invertible and stably reversible non-uniform cellular automata
• Characterization of 1-d Periodic Boundary Reversible CA
• On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View
• Reversibility of Elementary Cellular Automata under Fully Asynchronous Update
• A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA

Related Items (1)

A note on skew-asynchronous cellular automata

This page was built for publication: Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence