Variations of the firing squad problem and applications
From MaRDI portal
Publication:1116339
DOI10.1016/0020-0190(89)90134-8zbMath0665.68043MaRDI QIDQ1116339
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90134-8
Related Items
Synchronization of 1-way connected processors, Real time recognition with cellular automata : a meaningful example, The firing squad synchronization problem on Cayley graphs, Revisiting the cutting of the firing squad synchronization, Conjunctive and Boolean grammars: the true general case of the context-free grammars, Bounding the firing synchronization problem on a ring, On real time one-way cellular array, Closure properties of cellular automata, Low complexity classes of multidimensional cellular automata, An efficient solution of the firing mob problem, The synchronization of nonuniform networks of finite automata, Signals in one-dimensional cellular automata, Language not recognizable in real time by one-way cellular automata, Smaller solutions for the firing squad, Language equations, On hardest languages for one-dimensional cellular automata, Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines, The minimum firing time of the generalized firing squad synchronization problem for squares, The firing squad synchronization problem with sub-generals, Recognition of poly-slender context-free languages by trellis automata, A Compositional Approach to Synchronize Two Dimensional Networks of Processors, Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem, Different time solutions for the firing squad synchronization problem on basic grid networks
Cites Work
