scientific article; zbMATH DE number 3305051
From MaRDI portal
Publication:5586352
zbMath0192.07602MaRDI QIDQ5586352
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An Adaptive Algorithm for P System Synchronization ⋮ Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape ⋮ Algorithmic and complexity issues of robot motion in an uncertain environment ⋮ Cutting the Firing Squad Synchronization ⋮ Synchronization of interacting automata ⋮ The Firing Squad Problem Revisited. ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ A design of generalized minimum-state-change FSSP algorithms and their implementations ⋮ Revisiting the cutting of the firing squad synchronization ⋮ A new reconstruction and the first implementation of Goto's FSSP algorithm ⋮ Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays ⋮ State-efficient realization of fault-tolerant FSSP algorithms ⋮ FSSP Algorithms for 2D Rectangular Arrays. Recent Developments ⋮ The firing squad synchronization problem for graphs ⋮ A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays ⋮ About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ The firing squad synchronization problem on CA with multiple updating cycles ⋮ Firing squad synchronization problem in reversible cellular automata ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ Intrinsically universal \(n\)-dimensional quantum cellular automata ⋮ A 4-states algebraic solution to linear cellular automata synchronization ⋮ A Seven-State Time-Optimum Square Synchronizer ⋮ On time optimal solutions of the firing squad synchronization problem for two-dimensional paths ⋮ Synchronization and computing capabilities of linear asynchronous structures ⋮ The firing squad synchronization problem for a class of polyautomata networks ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ On the minimal firing time of the firing squad synchronization problem for polyautomata networks ⋮ A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based ⋮ The firing squad problem revisited ⋮ Error detection and correction in firing squad synchronization problem ⋮ Invertible cellular automata: A review ⋮ The firing squad synchronization problem with sub-generals ⋮ Smaller solutions for the firing squad
This page was built for publication:
