The minimum firing time of the generalized firing squad synchronization problem for squares

DOI10.1016/J.TCS.2014.06.016MaRDI QIDQ2253198zbMATH OpenOpenAlexFDO

Authors Kojiro Kobayashi

Publication date 25 July 2014

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

Full work available at URL https://doi.org/10.1016/j.tcs.2014.06.016

zbMATH Keywords

distributed computingcellular automatafiring squad synchronization problem

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Minimum and non-minimum time solutions to the firing squad synchronization problem
• On optimal solutions to the firing squad synchronization problem
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• On minimal-time solutions of firing squad synchronization problems for networks
• On the Complexity of the “Most General” Firing Squad Synchronization Problem
• Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• Developments in Language Theory
• Unconventional Computation
• On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem

Cites work

• scientific article; zbMATH DE number 4072387 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2013815 (Why is no real title available?)
• scientific article; zbMATH DE number 1869612 (Why is no real title available?)
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• A 4-states algebraic solution to linear cellular automata synchronization
• A generalized firing squad problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Bounding the firing synchronization problem on a ring
• Machines, Computations, and Universality
• On minimal-time solutions of firing squad synchronization problems for networks
• On the Complexity of Network Synchronization
• On the minimal firing time of the firing squad synchronization problem for polyautomata networks
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• Recent developments in constructing square synchronizers
• Seven-state solutions to the firing squad synchronization problem
• Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
• Smaller solutions for the firing squad
• Synchronization of interacting automata
• The firing squad synchronization problem for a class of polyautomata networks
• The firing squad synchronization problem for two-dimensional arrays
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• Two- and three-dimensional firing-squad synchronization problems
• Unconventional Computation
• Variations of the firing squad problem and applications

Cited in

(3)

• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem

This page was built for publication: The minimum firing time of the generalized firing squad synchronization problem for squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253198)