Abstract
In this paper some hints to synchronization problems and to their solutions in cellular automata are reviewed and two modifications are introduced.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R.M. Balzer An 8-state minimal time solution to the firing squad synchronization problem Information and Control 10 (1967), 22–42
C.D. Dyer, A. Rosenfeld Parallel image processing by memory-augmented cellular automata IEEE Trans. on Pattern Analysis and Machine Intelligence PAMI-3 (1981), 29–41
H.-D. Gerken über Synchronisationsprobleme bei Zellularautomaten Diploma Thesis, Braunschweig, 1987
G.T. Herman, W.H. Liu The daughter of Celia, the French flag, and the firing squad Simulation 21 (1973), 33–41
G.T. Herman, W.H. Liu, S. Rowland, A. Walker Synchronization of growing cellular arrays Information and Control 25 (1974), 103–121
M. Kutrib, R. Vollmar Minimal time synchronization in restricted defective cellular automata submitted for publication
M. Kutrib, R. Vollmar The firing squad synchronization problem in defective cellular automata submitted for publication
R.J. Lipton, R.E. Miller, L. Snyder Synchronization and computing capabilities of linear asynchronous structures J. of Computer and System Sciences 14 (1977), 49–72
J. Mazoyer A six-state minimal time solution to the firing squad synchronization problem Theoretical Computer Science 50 (1987), 183–238
J. Mazoyer An overview of the firing squad synchronization problem In: C. Choffrut (Ed.) Automata Networks Springer, Berlin, 1988, 82–94
H. Szwerinski Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position Theoretical Computer Science 19 (1982), 305–320
H. Szwerinski Zellularautomaten mit symmetrischer lokaler Transformation PhD Thesis, Braunschweig, 1982
R. Vollmar Algorithmen in Zellularautomaten Teubner, Stuttgart, 1979
R. Vollmar FSSP for cellular automata with broadcasting submitted for publication
A. Waksman An optimum solution to the firing squad synchronization problem Information and Control 9 (1966), 66–78
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vollmar, R. (1991). Some remarks on synchronization problems. In: Becker, J.D., Eisele, I., Mündemann, F.W. (eds) Parallelism, Learning, Evolution. WOPPLOT 1989. Lecture Notes in Computer Science, vol 565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55027-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-55027-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55027-3
Online ISBN: 978-3-540-46663-5
eBook Packages: Springer Book Archive