Skip to main content
SpringerLink
Log in

Computations on Cellular Automata

Some examples

  • Chapter
Cellular Automata

Part of the book series: Mathematics and Its Applications ((MAIA,volume 460))

Abstract

We show simple methods in order to construct cellular automata with a defined behavior. To achieve this goal, we explain how to move local information through the networks and to set up their meeting in order to get the wished global behavior. Some well-known examples are given: Fischer’s prime construction, Firing Squad Synchronization Problem and an “ad hoc” example of filter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Achasova S., Bondman O., Markova V. and Piskunov S. Parallel substitution algorithm. World Scientific, 1994.

    Google Scholar 

  • Albert J. and Öulik K. A simple universal cellular automaton and its one-way and totalistic version. Complex Systems Vol. no.1: 1–16, 1987.

    Google Scholar 

  • Balzer R. Studies concerning minimal time solutions to the firing squad synchronization problem. Ph.D. thesis, Carnegie Institute of Technology, 1966.

    Google Scholar 

  • Balzer R. An 8-states minimal time solution to the firing squad synchronization problem. Information and Control Vol. no.10: 22–42, 1967.

    Google Scholar 

  • Berlekamp E., Conway V., Elwyn R. and Guy R. Winning way for your mathematical plays, volume 2 Academic Press, 1982.

    Google Scholar 

  • Čulik K. and Hurd L. Computation theoretic aspects of cellular automata. Physica D Vol. no.32: 357–378, 1990.

    Google Scholar 

  • Delorme M., Mazoyer J. and Tougne L. Discrete parabolas and circles on 2D cellular automata. To appear in Theoretical Computer Science.

    Google Scholar 

  • Fischer P.C. Generation of primes by a one dimensional real time iterative array. Journal of A.C.M. Vol. no. 12: 388–394, 1965.

    Google Scholar 

  • Fokas A., Papadopoulou E. and Saridakis V. Particles in soliton cellular automata. Complex Systems Vol. no. 3: 615–633, 1989.

    Google Scholar 

  • Goto E. A minimal time solution to the firing squad synchonization problem. Course notes for applied mathematics Harvard University, 1962.

    Google Scholar 

  • Levin L. Theory of computation: How to start. SIGACT News Vol. 22 no.1: 47–56, 1991.

    Google Scholar 

  • Lindgren K. and Nordahl M. Universal computation in simple one dimensional cellular automata. Complex Systems Vol. no. 4: 299–318, 1990.

    Google Scholar 

  • Martin B. A universal automaton in quasi-linear time with its s-n-m form. Theoretical Computer Science Vol. no. 124: 199–237, 1994.

    Google Scholar 

  • MazoyerJ. A six states minimal time solution to the firing squad synchronization problem. Theoretical Computer Science Vol. no. 50: 183–238, 1987.

    Google Scholar 

  • Mazoyer J. Entrées et sorties sur lignes d’automates. Algorithmique Parallèle, Masson, C.snard C., Nivat M. and Robert Y., Eds, 47–61, 1992.

    Google Scholar 

  • Mazoyer J. and Terrier V. Signals on one dimensional cellular automata. To appear in Theoretical Computer Science., 1998.

    Google Scholar 

  • Minsky M. Finite and infinite machines Prentice Hall, 28–29, 1967.

    Google Scholar 

  • Signorini J. Programmation par configurations des ordinateurs cellulaires à très grande échelle. Ph.D. thesis, Université Paris 8, 1992.

    Google Scholar 

  • Smith A. Real time languages by one-dimensional cellular automata. Journal of Computer and System Sciences Vol. no. 6: 233–253, 1972.

    Google Scholar 

  • Terrier V. Temps réel sur automates cellulaires. Ph.D. thesis, Université Lyon 1, 1991. Waksman A. An optimum solution to the firing squad synchronization problem. Information and Control Vol. no. 9: 66–78, 1966.

    Google Scholar 

  • Wolfram S. Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986.

    MATH  Google Scholar 

  • Yunes J.B. Seven states solutions to the Firing Squad Synchronization Problem. Theoretical Computer Science Vol. 127 no. 2: 313–332, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP ENS Lyon, 46 Allée d’Italie, 69364, Lyon Cedex 07, France

    J. Mazoyer

Authors
  1. J. Mazoyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire de l’Informatique du Parallélisme, ENS Lyon, Lyon, France

    M. Delorme  & J. Mazoyer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Mazoyer, J. (1999). Computations on Cellular Automata. In: Delorme, M., Mazoyer, J. (eds) Cellular Automata. Mathematics and Its Applications, vol 460. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9153-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9153-9_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5143-1

  • Online ISBN: 978-94-015-9153-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation