Pages that link to "Item:Q2832036"
From MaRDI portal
The following pages link to An 8-state minimal time solution to the firing squad synchronization problem (Q2832036):
Displaying 50 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The firing squad synchronization problem on CA with multiple updating cycles (Q475400) (← links)
- Some remarks about the ''efficiency'' of polyautomata (Q594595) (← links)
- 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)
- Network structure and the firing squad synchronization problem (Q1050112) (← links)
- A six-state minimal time solution to the Firing squad synchronization problem (Q1097699) (← links)
- The firing squad synchronization problem for graphs (Q1149772) (← links)
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position (Q1170036) (← links)
- An efficient solution of the firing mob problem (Q1183587) (← links)
- The synchronization of nonuniform networks of finite automata (Q1187031) (← links)
- A linear speed-up theorem for cellular automata (Q1193411) (← links)
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (Q1220388) (← links)
- On 'forgetful' cellular automata (Q1227707) (← links)
- Deterministic Lindenmayer languages, nonterminals and homomorphisms (Q1228208) (← links)
- Cellular automata synchronization (Q1229190) (← links)
- On the fast synchronization of tree connected networks (Q1240713) (← links)
- The firing squad synchronization problem for a class of polyautomata networks (Q1251898) (← links)
- Parallel turing machines with one-head control units and cellular automata (Q1285791) (← links)
- Signals in one-dimensional cellular automata (Q1285793) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- Seven-state solutions to the firing squad synchronization problem (Q1342240) (← links)
- Recognition of graphs by automata (Q1349690) (← links)
- On optimal solutions to the firing squad synchronization problem (Q1349868) (← links)
- Automated theorem proving in mathematics. (Q1353941) (← links)
- Linear speed-up for cellular automata synchronizers and applications (Q1389648) (← links)
- Parallel recognition of rational languages in plane cellular automata (Q1603694) (← links)
- Smaller solutions for the firing squad (Q1605305) (← links)
- Faster synchronization in P systems (Q1761716) (← 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)
- The minimum firing time of the generalized firing squad synchronization problem for squares (Q2253198) (← links)
- The firing squad synchronization problem with sub-generals (Q2350603) (← links)
- A new reconstruction and the first implementation of Goto's FSSP algorithm (Q2422859) (← links)
- Appendix I. A brief review of cellular automata packages (Q2640356) (← links)
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
- Synchronizing square arrays in optimum-time (Q2869786) (← links)
- An Adaptive Algorithm for P System Synchronization (Q2890287) (← 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)
- Synchronization of 1-way connected processors (Q5055943) (← links)
- A design of generalized minimum-state-change FSSP algorithms and their implementations (Q6062008) (← links)
