On the minimal firing time of the firing squad synchronization problem for polyautomata networks
type: Item
instance of: scholarly article
title: On the minimal firing time of the firing squad synchronization problem for polyautomata networks
zbMATH Open document ID: 0397.68050
DOI: 10.1016/0304-3975(78)90046-4
author: Kojiro Kobayashi
published in: Theoretical Computer Science
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 3617550
zbMATH Keywords: Minimal Firing Time
zbMATH Keywords: Firing Squad Synchronization Problem For Polyautomata Networks
MaRDI profile type: Publication
full work available at URL: 0304-3975(78)90046-4
OpenAlex ID: W2042455821
cites work: The firing squad synchronization problem for two-dimensional arrays
cites work: The firing squad synchronization problem for a class of polyautomata networks
cites work: Q5586352
cites work: Cellular automata synchronization
cites work: Q5681937
cites work: An optimum solution to the firing squad synchronization problem
description: scientific article; zbMATH DE number 3617550