Pages that link to "Item:Q1116339"
From MaRDI portal
The following pages link to Variations of the firing squad problem and applications (Q1116339):
Displayed 18 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Bounding the firing synchronization problem on a ring (Q596090) (← links)
- On real time one-way cellular array (Q673792) (← links)
- Closure properties of cellular automata (Q818118) (← links)
- Low complexity classes of multidimensional cellular automata (Q861257) (← links)
- An efficient solution of the firing mob problem (Q1183587) (← links)
- The synchronization of nonuniform networks of finite automata (Q1187031) (← links)
- Signals in one-dimensional cellular automata (Q1285793) (← links)
- Language not recognizable in real time by one-way cellular automata (Q1351802) (← links)
- Smaller solutions for the firing squad (Q1605305) (← 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)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- Real time recognition with cellular automata : a meaningful example (Q5286058) (← links)
- The firing squad synchronization problem on Cayley graphs (Q5915397) (← links)