Variations of the firing squad problem and applications

DOI10.1016/0020-0190(89)90134-8zbMath0665.68043OpenAlexW2004637691MaRDI QIDQ1116339

Karel II Culik

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

zbMATH Keywords

cellular automatareal-timefiring squad problemone-way cellular arraystrellis language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (25)

Closure properties of cellular automata ⋮ Real time recognition with cellular automata : a meaningful example ⋮ Synchronization of 1-way connected processors ⋮ Language not recognizable in real time by one-way cellular automata ⋮ Low complexity classes of multidimensional cellular automata ⋮ Bounding the firing synchronization problem on a ring ⋮ Recognition of poly-slender context-free languages by trellis automata ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Revisiting the cutting of the firing squad synchronization ⋮ Inductive definitions in logic versus programs of real-time cellular automata ⋮ On hardest languages for one-dimensional cellular automata ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ An efficient solution of the firing mob problem ⋮ The synchronization of nonuniform networks of finite automata ⋮ On real time one-way cellular array ⋮ 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 on Cayley graphs ⋮ On hardest languages for one-dimensional cellular automata ⋮ Language equations ⋮ Signals in one-dimensional cellular automata ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ The firing squad synchronization problem with sub-generals ⋮ Smaller solutions for the firing squad

Cites Work

• Unnamed Item
• On real-time cellular automata and trellis automata
• Topological transformations as a tool in the design of systolic networks
• An optimum solution to the firing squad synchronization problem
• Systolic trellis automatat†
• On One-Way Cellular Arrays
• A generalized firing squad problem

This page was built for publication: Variations of the firing squad problem and applications