Abstract
This chapter shows how simple, common algorithms (multiplication and prime number sieve) lead to very natural cellular automata implementations. All these implementations are built with some natural basic tools: signals and grids. Attention is first focussed on the concept of signals and how simple and rich they are to realize computations. Looking closely at the space–time diagrams and the dependencies induced by the computations reveals the concept of grids, and shows how powerful they are in the sense of computability theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adamatzky A (2002) Collision-based computing. Springer, London. ISBN 978-1852335403
Atrubin AJ (1965) A one-dimensional real-time iterative multiplier. IEEE Trans Electron Comput 14:394–399
Choffrut C, Čulik K II (1984) On real-time cellular automata and trellis automata. Acta Inform 21:393–407
Cole SN (1969) Real-time computation by n-dimensional iterative arrays of finite-states machines. IEEE Trans Comput C-18(4):349–365
Čulik K II, Gruska J, Salomaa A (1982) Systolic trellis automata for VSLI on balanced trees. Acta Inform 18:335–344
Delorme M, Mazoyer J (1999) Cellular automata: A parallel model. Mathematics and its applications, vol 460. Kluwer, Dordrecht. ISBN 0-7923-5493-1
Even S (1991) Systolic modular multiplication. In: Advances in cryptology: CRYPT0'90. Lecture notes on computer science, vol 537. Springer, New York, pp 620–624
Fischer PC (1965) Generation of primes by a one-dimensional real-time iterative array. J ACM 12(3):388–394
Goyal LN (1976) A note on Atrubin's real-time iterative multiplier. IEEE Trans Electron Comput C25(5):546–548
Knuth DE (1997) Seminumerical algorithms, the art of computer programming. vol 2, 2nd edn. Addison-Wesley, Reading, MA. ISBN 0-201-03822-6
Korec I (1997) Real-time generation of primes by a one-dimensional cellular automaton with 9 States. Preprint Series of Mathematical Institute of Slovak Academy of Sciences, Bratislava, Preprint 13/1997
Mazoyer J (1987) A six states minimal time solution to the firing squad synchronization problem. Theor Comput Sci 50:183–328
Mazoyer J, Terrier V (1999) Signals in one-dimensional cellular automata. Theor Comput Sci 217(1):53–80 DOI 10.1016/S0304-3975(98)00150-9
McNaughton R (1961) The theory of automata, a survey. Adv Comput 2:379–421
Poupet V (2005) Cellular automata: Real-time equivalence between one-dimensional neighborhoods. In: STACS 2005. Proceedings of the 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005 pp 133–144
Wolfram S (2002) A new kind of science. Wolfram Media, Champaign, IL
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this entry
Cite this entry
Mazoyer, J., Yunès, JB. (2012). Computations on Cellular Automata. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds) Handbook of Natural Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-92910-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92909-3
Online ISBN: 978-3-540-92910-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering