A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
., Seven-state solutions to the Firing Squad Synchronization Problem, Theoretical Computer Science 127 (1994) 313-332. ... We show that seven states are enough to implement Minsky-like solutions to the Firing Squad Synchronization Problem in a linear network of n finite state cellular automata with null transmission delay. ... Myhill in 1957, the Firing Squad Synchronization Problem (FSSP) can be expressed as follows: Given a firing squad and knowing that any order given by a general located at one of the two ends needs n units ...doi:10.1016/0304-3975(94)90045-0 fatcat:7p2yg54gt5dttnw67a63k6j57q
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. ... In the present paper, we describe a computer-assisted investigation into state transition tables for which optimum-time synchronization algorithms have been designed. ... Firing Squad Synchronization Problem Definition of the Firing Squad Synchronization Problem The firing squad synchronization problem is formalized in terms of the model of cellular automata. ...doi:10.4036/iis.2002.207 fatcat:674p5hgtanb4zds372nzeycb3i
ACKNOWLEDGMENT I am indebted to Dr. Allen Newell for his suggestions and guidance. RECEIVED: February 28, 1966 ... These seven states and the terminal firing state (F) represent all the states necessary for a minimal time solution to the Firing Squad Synchronization Problem. ... does not constitute a solution to the Firing Squad Synchronization Problem. ...doi:10.1016/s0019-9958(67)90032-0 fatcat:r7seiniahfdnrnicfvpfefyqpi
The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore ... The first solution to this problem was given by Minsky and McCarthy  and a minimal time solution was given by Goto  . ... Acknowledgments The authors are grateful to Mr. Takemasa and Mr. Asai (for- ...doi:10.1587/transinf.e93.d.3276 fatcat:khd4ib6uzzbrvpurvwg7dk6dim
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. ... In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules ... Acknowledgements The authors wish to thank John Morris and the three anonymous reviewers for detailed comments and feedback that helped us improve the paper. ...doi:10.4204/eptcs.11.7 fatcat:5qt5pu736vegzfn5ecsxb5wsv4
The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. ... In this paper, we introduce a new state called the sub-general to the original problem and propose the FSSP with sub-generals. ... Acknowledgements The authors would like to thank the editor and the reviewers who gave us valuable advice and suggestions. ...doi:10.1016/j.ipl.2013.08.003 fatcat:lk2x23jdkzagjes35vhy2iprqe
An efficient solution of the firing mob problem, which is the generalization of the well-known "firing squad synchronization" problem to finite bounded-degree networks, is presented. ... All rights reserved An eficient solution of the firing mob problem 65 ... An overview of the firing squad synchronization problem is given in  . Here we present an efficient solution of the firing mob problem for general networks. ...doi:10.1016/0304-3975(91)90267-6 fatcat:zkcu4bidxjfejfhxus5m3h7gj4
well-known from computer science, Firing Squad Synchronization Problem (FSSP). ... Among the numerous FSSP's algorithmic solutions in literature, the Mazoyer algorithm has proven to be the most efficient one. ... FIRING SQUAD SYNCHRONIZATION PROBLEM Firing Squad Synchronization (FSS) problem, initially introduced by Myhill (1957) and then solved in the early sixties by Moore  , describes a random length ...doi:10.1109/ojnano.2020.3041399 fatcat:fy6aiuvhifgldolk4mxpmbbske
This paper proposes an optimization approach for solving a classical problem in cellular automata theory: the 6-states Firing Squad Synchronization Problem (FSSP). ... To this purpose, we introduce an original optimization function which quantifies the quality of solutions according only to the main goal of the problem without taking into account any side information ... Firing Squad Synchronization Problem The Firing Squad Synchronization Problem (FSSP) was first proposed by Myhill in 1957 and published by Moore in 1964  . ...doi:10.1016/j.asoc.2018.01.026 fatcat:btm2ps32sjhcfb3tz5doai6bre
The modified firing squad synchronization problem, in the sense of the present paper, is the following: In a chain of n automata, where each is directly connected with its two neighbours, k au- tomata ... The prob- lem is to specify the structure of the automata such that, indepen- dently of the number of automata and generals, all members enter the “fire” state at the same time. ...
(F-PARIS6-BP; Paris) Seven-state solutions to the firing squad synchronization problem. (English summary) Theoret. Comput. Sci. 127 (1994), no. 2, 313-332. ... A solution to the (linear cellular automaton) firing squad synchro- nization problem with six states is due to J. Mazoyer [Theoret. Comput. Sci. 50 (1987), no. 2, 183-238; MR 89f:68026]. ...
From Balzer's work (1967) , we know that the firing squad synchronization problem has a minimal-time solution with eight states. We show that such a solution exists with only six states. ... Our method is somewhat different from all previous ones: the initial line is iteratively divided in two inequal parts so that each new right part can be treated as the homothetical image of a shorter initial ... We now prove that the automaton ecti kS . are indicated in Fig. 15 ) is indeed a minimal time solution of the firing squad synchronization problem. ...doi:10.1016/0304-3975(87)90124-1 fatcat:5lrnotub2jfvbk6isxw3zynooy
The synchronization in cellular automata has been known as the firing squad synchronization problem (FSSP). ... to the FSSP. ... There exist 4-state partial solutions to the firing squad synchronization problem for rings and arrays. ...doi:10.1109/icnc.2012.72 dblp:conf/ic-nc/Umeo12 fatcat:fwxtmemrpvaprddrxzu2hf74gm
In this paper we improve the bounds on the complexity of solutions to the¯ring squad problem, also known as the¯ring synchronization problem. ... In our work we improve the construction for the best known minimal-time solution to the generalized problem by reducing the number of states needed and give non-minimaltime solutions to the original and ... In Section 4.1 we present the six-state solution to the original problem, and in Section 4.4 we give the seven-state solution to the generalized problem. ...doi:10.1016/s0304-3975(01)00191-8 fatcat:ar7l6iempfeg3ir5ixhfus5tfm
This allows us to apply well-known results of the general theory of computation to cellular automata and might give a practical framework for studying the structural complexity of cellular automata computations ... The simulation is based on a novel programming language (the brick language), which simplifies the recursive specifications of transition functions. ... Firing squad synchronization Thefiring squad synchronization problem is due to Myhill (1957 Each soldier may be represented by a cell of a cellular automaton. ...doi:10.1016/0304-3975(92)00076-4 fatcat:m7t57xxt7ngv7gauqx2loetmhq
« Previous Showing results 1 — 15 out of 625 results