The firing squad synchronization problem on CA with multiple updating cycles
type: Item
instance of: scholarly article
title: The firing squad synchronization problem on CA with multiple updating cycles
zbMATH Open document ID: 1360.68616
author: Luca Manzoni
author: Hiroshi Umeo
published in: Theoretical Computer Science
publication date: 2014-11-26T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 6374355
zbMATH Keywords: firing squad synchronization problem
zbMATH Keywords: cellular automata
zbMATH Keywords: asynchronicity
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.08.011
OpenAlex ID: W2044446447
cites work: An 8-state minimal time solution to the firing squad synchronization problem
cites work: \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
cites work: Q5321519
cites work: Fully asynchronous behavior of double-quiescent elementary cellular automata
cites work: Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
cites work: Probabilistic cellular automata with conserved quantities
cites work: Synchronization of cellular arrays: The firing squad problem in two dimensions
cites work: Q3357556
cites work: Asynchronous cellular automata and dynamical properties
cites work: On optimal solutions to the firing squad synchronization problem
cites work: Q5590814
cites work: Q5586352
cites work: A generalized firing squad problem
cites work: Two- and three-dimensional firing-squad synchronization problems
cites work: Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
cites work: Q4434779
cites work: Synchronization of interacting automata
cites work: An optimum solution to the firing squad synchronization problem
cites work: Q5446318
DOI: 10.1016/J.TCS.2014.08.011
description: scientific article; zbMATH DE number 6374355