Skip to main content
SpringerLink
Log in

Captive Cellular Automata

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

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

Abstract

We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some algebraic properties of the class and show that it contains intrinsically universal cellular automata. In addition we show that Rice’s theorem for limit sets is no longer true for that class, although infinitely many properties of limit sets are still undecidable.

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. Albert, J., Čulik II., K.: A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1, 1–16 (1987)

    MATH  MathSciNet  Google Scholar 

  2. Banks, E.R.: Universality in cellular automata. In: Eleventh Annual Symposium on Switching and Automata Theory, Santa Monica, California, IEEE, Los Alamitos (1970)

    Google Scholar 

  3. Čulik II, K., Pachl, J., Yu, S.: On the limit sets of cellular automata. SIAM Journal on Computing 18(4), 831–842 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fagnani, F., Margara, L.: Expansivity, permutivity, and chaos for cellular automata. Theory of Computing Systems 31(6), 663–677 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goles, E., Olivos, J.: The convergence of symmetric threshold automata. Information and Control 51, 98–104 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hedlund, G.A.: Endomorphisms and Automorphisms of the Shift Dynamical Systems. Mathematical Systems Theory 3(4), 320–375 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kari, J.: The Nilpotency Problem of One-dimensional Cellular Automata. SIAM Journal on Computing 21, 571–586 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kari, J.: Rice’s theorem for the limit sets of cellular automata. Theoretical Computer Science 127, 229–254 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory and Dynamical Systems 17, 417–433 (1997)

    Google Scholar 

  10. Martin, O., Odlyzko, A., Wolfram, S.: Algebraic properties of cellular automata. Communications in Mathematical Physics 93, 219 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mazoyer, J., Rapaport, I.: Inducing an Order on Cellular Automata by a Grouping Operation. In: Symposium on Theoretical Aspects of Computer Science. LNCS, Springer, Heidelberg (1998)

    Google Scholar 

  12. Ollinger, N.: Toward an algorithmic classification of cellular automata dynamics. Reasearch report 2001-10, Laboratoire de l’Informatique du Parallèlisme (January 2001)

    Google Scholar 

  13. Ollinger, N.: Automates Cellulaires : structures. PhD thesis, École Normale Supérieure de Lyon (Décembre 2002)

    Google Scholar 

  14. Ollinger, N.: The quest for small universal cellular automata. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 318–330. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Richardson, D.: Tesselations with local tranformations. Journal of Computer and System Sciences 5, 373–388 (1972)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP UMR CNRS, ENS Lyon, INRIA, Univ. Claude Bernard Lyon 1, École Normale Supérieure de Lyon, 46 allée d’Italie, 69364 cedex 07, LYON, FRANCE

    Guillaume Theyssier

Authors
  1. Guillaume Theyssier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Theyssier, G. (2004). Captive Cellular Automata. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation