A six-state minimal time solution to the Firing squad synchronization problem
From MaRDI portal
Publication:1097699
DOI10.1016/0304-3975(87)90124-1zbMath0635.68042WikidataQ29300723 ScholiaQ29300723MaRDI QIDQ1097699
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90124-1
systolic array; finite state automata; firing squad synchronization; minimization of the number of states; one-dimensional cellular structure
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q80: Cellular automata (computational aspects)
Related Items
An efficient solution of the firing mob problem, A linear speed-up theorem for cellular automata, On the limit set of some universal cellular automata