A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)

DOI10.1007/s00236-020-00391-6OpenAlexW3183396417MaRDI QIDQ2041690

Gen Fujita, Naoki Kamikawa, Hiroshi Umeo

Publication date: 23 July 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00391-6

zbMATH Keywords

firing squad synchronization problemcellular automatonFSSPfull versus partial solutionsmallest FSSP protocolstate lower bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks about the efficiency of polyautomata
• Bounding the firing synchronization problem on a ring
• A 4-states algebraic solution to linear cellular automata synchronization
• A six-state minimal time solution to the Firing squad synchronization problem
• The smallest FSSP partial solutions for one-dimensional ring cellular automata: symmetric and asymmetric synchronizers
• Cellular automata with sparse communication
• On One-way One-bit O (One)-message Cellular Automata
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• A Smallest Five-State Solution to the Firing Squad Synchronization Problem

This page was built for publication: A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)