scientific article; zbMATH DE number 3305051

zbMATH Open0192.07602MaRDI QIDQ5586352FDOQ5586352

Authors: Edward F. Moore 

Publication date: 1964

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

zbMATH Keywords

languages, automata, networks

Cited In (33)

• Algorithmic and complexity issues of robot motion in an uncertain environment
• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• A 4-states algebraic solution to linear cellular automata synchronization
• Revisiting the cutting of the firing squad synchronization
• The Firing Squad Problem Revisited.
• State-efficient realization of fault-tolerant FSSP algorithms
• Firing squad synchronization problem in reversible cellular automata
• The firing squad synchronization problem with sub-generals
• Intrinsically universal \(n\)-dimensional quantum cellular automata
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• The minimum firing time of the generalized firing squad synchronization problem for squares
• A design of generalized minimum-state-change FSSP algorithms and their implementations
• FSSP Algorithms for 2D Rectangular Arrays. Recent Developments
• Invertible cellular automata: A review
• The firing squad synchronization problem for graphs
• Synchronization and computing capabilities of linear asynchronous structures
• On the minimal firing time of the firing squad synchronization problem for polyautomata networks
• Time-Optimum Smaller-State Synchronizers for Cellular Automata
• The firing squad synchronization problem for a class of polyautomata networks
• Smaller solutions for the firing squad
• About 4-States Solutions to the Firing Squad Synchronization Problem
• The firing squad synchronization problem on CA with multiple updating cycles
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• Synchronization of interacting automata
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Cutting the Firing Squad Synchronization
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• An adaptive algorithm for P system synchronization
• A seven-state time-optimum square synchronizer
• Error detection and correction in firing squad synchronization problem
• A new reconstruction and the first implementation of Goto's FSSP algorithm
• The firing squad problem revisited

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 Q5586352)