scientific article; zbMATH DE number 3990874

zbMATH Open0612.68047MaRDI QIDQ3753491FDOQ3753491

Authors:

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• A six-state minimal time solution to the Firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• Simple 8-state minimal time solution to the firing squad synchronization problem
• A Smallest Five-State Solution to the Firing Squad Synchronization Problem

zbMATH Keywords

finite state machinetransition rules

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Cellular automata (computational aspects) (68Q80)

Cited In (8)

• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• Title not available (Why is that?)
• A six-state minimal time solution to the Firing squad synchronization problem
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• A Smallest Five-State Solution to the Firing Squad Synchronization Problem
• Simple 8-state minimal time solution to the firing squad synchronization problem

This page was built for publication:

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