An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata

DOI10.1016/j.physd.2020.132554OpenAlexW3045402057MaRDI QIDQ2077625

Eurico L. P. Ruivo, Kévin Perrot, Pedro Paulo Balbi

Publication date: 21 February 2022

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physd.2020.132554

zbMATH Keywords

cellular automatasynchronismasynchronyblock sequential asynchronous updatedeterministic update schedulessynchronisation problem

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (3)

Discrete models of complex systems: recent trends and analytical challenges ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of cellular automata: a survey
• A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces
• On the Synchronisation Problem over Cellular Automata
• Remarks on the Cellular Automaton Global Synchronisation Problem

This page was built for publication: An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata