Pages that link to "Item:Q1097699"

The following pages link to A six-state minimal time solution to the Firing squad synchronization problem (Q1097699):

Displaying 50 items.

• Bounding the firing synchronization problem on a ring (Q596090) (← links)
• Firing squad synchronization problem in reversible cellular automata (Q671532) (← links)
• Leader election on two-dimensional periodic cellular automata (Q729998) (← links)
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays (Q907212) (← links)
• A 4-states algebraic solution to linear cellular automata synchronization (Q963403) (← links)
• An efficient solution of the firing mob problem (Q1183587) (← links)
• A linear speed-up theorem for cellular automata (Q1193411) (← links)
• On the limit set of some universal cellular automata (Q1210540) (← links)
• Signals in one-dimensional cellular automata (Q1285793) (← links)
• Seven-state solutions to the firing squad synchronization problem (Q1342240) (← links)
• On optimal solutions to the firing squad synchronization problem (Q1349868) (← links)
• Automated theorem proving in mathematics. (Q1353941) (← links)
• Smaller solutions for the firing squad (Q1605305) (← links)
• Intrinsically universal \(n\)-dimensional quantum cellular automata (Q1757844) (← links)
• Partitioned quantum cellular automata are intrinsically universal (Q1761701) (← links)
• Faster synchronization in P systems (Q1761716) (← links)
• Theory of cellular automata: a survey (Q1779295) (← links)
• Computations on one-dimensional cellular automata (Q1817072) (← links)
• Simple 8-state minimal time solution to the firing squad synchronization problem (Q1826636) (← links)
• A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (Q2041690) (← links)
• Error detection and correction in firing squad synchronization problem (Q2086741) (← links)
• On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
• Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines (Q2243586) (← links)
• The firing squad synchronization problem with sub-generals (Q2350603) (← links)
• A single-copy minimal-time simulation of a torus of automata by a ring of automata (Q2384397) (← links)
• A new reconstruction and the first implementation of Goto's FSSP algorithm (Q2422859) (← links)
• Grids and universal computations on one-dimensional cellular automata (Q2629940) (← links)
• A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
• Synchronizing square arrays in optimum-time (Q2869786) (← links)
• Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
• Time-Optimum Smaller-State Synchronizers for Cellular Automata (Q2944884) (← links)
• A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based (Q3091468) (← links)
• Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS (Q3444850) (← links)
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem (Q3514634) (← links)
• About 4-States Solutions to the Firing Squad Synchronization Problem (Q3541749) (← links)
• HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM? (Q3542878) (← links)
• Cutting the Firing Squad Synchronization (Q4571177) (← links)
• A Seven-State Time-Optimum Square Synchronizer (Q4931212) (← links)
• Achieving Universal Computations on One-Dimensional Cellular Automata (Q4931277) (← links)
• Synchronization of 1-way connected processors (Q5055943) (← links)
• COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
• Fast Synchronization in P Systems (Q5191165) (← links)
• Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces (Q5501615) (← links)
• The firing squad synchronization problem on Cayley graphs (Q5915397) (← links)
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths (Q5941273) (← links)
• Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)
• A design of generalized minimum-state-change FSSP algorithms and their implementations (Q6062008) (← links)
• Revisiting the cutting of the firing squad synchronization (Q6084230) (← links)
• Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)