Skip to main content
SpringerLink
Log in

Signals for Cellular Automata in Dimension 2 or Higher

  • Conference paper
  • First Online:
LATIN 2002: Theoretical Informatics (LATIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2286))

Included in the following conference series:

Abstract

We investigate how increasing the dimension of the array can help to draw signals on cellular automata. We show the existence of a gap of constructible signals in any dimension. We exhibit two cellular automata in dimension 2 to show that increasing the dimension allows to reduce the number of states required for some constructions.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. E. R. Berlekamp, John H. Conway, and R. K. Guy. Winning Ways for Your Mathematical Plays, volume 2, chapter 25. Academic Press, 1982.

    Google Scholar 

  2. Christian Choffrut and Karel Čulik, II. On real-time cellular automata and trellis automata. Acta Informatica, 21:393–407, 1984.

    Article  MathSciNet  Google Scholar 

  3. Marianne Delorme, Enrico Formenti, and Jacques Mazoyer. Open problems on cellular automata. Research report 2000-25, École normale supérieure de Lyon, July 2000.

    Google Scholar 

  4. Patrick C. Fischer. Generation of primes by a one-dimensional real-time iterative array. JACM, 12:388–394, 1965.

    Article  MathSciNet  Google Scholar 

  5. Oscar H. Ibarra, Sam M. Kim, and Shlomo Moran. Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput., 14(2):426–447, 1985.

    Article  MathSciNet  Google Scholar 

  6. Andreas Klein and Martin Kutrib. A time hierarchy for bounded one-way cellular automata. In J. Sgall, A. Pultr, and P. Kolman, editors, MFCS 2001, volume 2136 of LNCS. Springer, 2001. To appear.

    Google Scholar 

  7. Bruno Martin. Apparent entropy of cellular automata. Complex Systems, 12(2), 2000.

    Google Scholar 

  8. Jacques Mazoyer. A six-states minmal solution to the firing squad synchronization problem. TCS, 50:183–238, 1987.

    Article  MathSciNet  Google Scholar 

  9. Jacques Mazoyer and Véronique Terrier. Signals in one-dimensional cellular automata. TCS, 217:53–80, 1999.

    Article  MathSciNet  Google Scholar 

  10. John von Neumann. Theory of Self-Reproducing Automata. University of Illinois, Urbana, 1966.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Paris-Sud, LRI, Bâtiment 490, F-91405, Orsay Cedex, France

    Jean-Christophe Dubacq

  2. GREYC, Campus II, Université de Caen, F-14032, Caen Cedex, France

    Véronique Terrier

Authors
  1. Jean-Christophe Dubacq
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Véronique Terrier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Compaq Cambridge Research Laboratory, One Cambridge Center, 02142-1612, Cambridge, MA, USA

    Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubacq, JC., Terrier, V. (2002). Signals for Cellular Automata in Dimension 2 or Higher. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-45995-2_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43400-9

  • Online ISBN: 978-3-540-45995-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation