Imai, K., and Morita, K., Firing squad synchronization problem in reversible cellular automata, Theoret. Comput. Sci., 165, 475--482 (1996). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Compositional Approach to Synchronize Two Dimensional.. - Torre, Napoli, Parente (2000) (Correct)
....we briefly recall some of them. The FSSP has been studied on a (one way) ring of n processors [2, 7] on arrays of two and three dimensions [5, 6, 15] and on graphs [13, 14] Some constrained variations of the FSSP have concerned solutions on reversible CA (i.e. backward deterministic CA) [3] and CA with a number conserving property (i.e. a state is a tuple of positive integers whose sum is constant during the computation) 4] Other kinds of constraints have concerned the amount of information which is allowed to exchange between any pair of adjacent processors: unidirectional flow ....
K. Imai and K. Morita, Firing squad synchronization problem in reversible cellular automata, Theoretical Computer Science, 165 (1996), 475-482.
A Compositional Approach to Synchronize Two Dimensional.. - Torre, Napoli, Parente (Correct)
....we briefly recall some of them. The FSSP has been studied on a (one way) ring of n processors [2, 7] on arrays of two and three dimensions [5, 6, 15] and on graphs [13, 14] Some constrained variations of the FSSP have concerned solutions on reversible CA (i.e. backward deterministic CA) [3] and CA with a number conserving property (i.e. a state is a tuple of positive integers whose sum is constant during the computation) 4] Other kinds of constraints have concerned the amount of information which is allowed to exchange between any pair of adjacent processors: unidirectional flow ....
K. Imai and K. Morita, Firing squad synchronization problem in reversible cellular automata, Theoretical Computer Science, 165 (1996), 475-482.
Unknown - Th Summer School (1998) Self-citation (Morita) (Correct)
No context found.
Imai, K., and Morita, K., Firing squad synchronization problem in reversible cellular automata, Theoret. Comput. Sci., 165, 475--482 (1996).
Cellular Automata and Artificial Life - Computation and Life in.. - Morita (1998) Self-citation (Morita) (Correct)
....number of states for each grid type. Some other problems, e.g. to find a simple computation universal (in the strong sense) 2 D RPCA, to simplify the computation universal 1 D models, to find new tasks which can be performed by an RPCS (e.g. a solution for the firing squad synchronization [21]) and so on, are also left for the future study. There also remain problems having a relation to artificial life. For example, to construct a self reproducing RCA of von Neuman s sense. It will be an interesting problem to design self reproducing objects in an elegant way which have some ....
Imai, K., and Morita, K., Firing squad synchronization problem in reversible cellular automata, Theoret. Comput. Sci., 165, 475--482 (1996).
Firing Squad Synchronization Problem on Bidimensional.. - Torre, Napoli, Parente (Correct)
No context found.
K. Imai and K. Morita, Firing squad synchronization problem in reversible cellular automata, Theoretical Computer Science, 165 (1996), 475-482.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC