Skip to main content
Log in

On the behavior characteristics of cellular automata

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

In this paper, the inherent relationships between the running regulations and behavior characteristics of cellular automata are presented; an imprecise taxonomy of such systems is put forward; the three extreme cases of stable systems are discussed; and the illogicalness of evolutional strategies of cellular automata is analyzed. The result is suitable for the emulation and prediction of behavior of discrete dynamics systems; especially it can be taken as an important analysis means of dynamic performance of complex networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Theyssier G. How Common Can Be Universality for Cellular Automata?Lecture Notes in Computer Science, 2005,3404: 121–132.

    Article  MathSciNet  Google Scholar 

  2. Schulz R, Reggia J A. Predicting Nearest Agent Distances in Artificial Worlds.Artificial life, 2002,8(3):247–264.

    Article  Google Scholar 

  3. Langton C G. Editor’s Introduction.Artificial Life Journal, 1994,1(1):5.

    Google Scholar 

  4. Usami Y, Saburo H, Inaba S,et al. Reconstruction of Extinct Animals in the Computer. In: Adami C, Belew R K, Kitano H,et al eds.Proceedings of the 6th International Conference on Artificial Life, Artificial Life, 1998,VI: 173–177.

  5. Bell G I, Marr T G.Computers and DNA. New York: Addison-Wesley & Longman, 1990.

    Google Scholar 

  6. Chen Hong-juan, Ban Xiao-juan, Ai Di-ming,et al. Concept, Contents and Methods of Artificial Life.Journal of University of Science and Technology Beijing, 2002,24 (3):353–356 (Ch).

    Google Scholar 

  7. Toffoli T, Capobianco S, Mentrasti P. How to Turn a Second-Order Cellular Automaton into a Lattice Gas: A New Inversion Scheme.Theoretical Computer Science, 2004,325 (2):329–344.

    Article  MATH  MathSciNet  Google Scholar 

  8. Cattaneo G, Dennunzio A. Subshifts Behavior of Cellular Automata: Topological Properties and Related Languages.Lecture Notes in Computer Science, 2005,3354:140–152.

    Article  MathSciNet  Google Scholar 

  9. Chelghoum K, Margenstern M, Martin B,et al. Initialising Cellular Automata in the Hyperbolic Plane.IEICE Transactions on Information and Systems, 2004,E87-D(3):677–686.

    Google Scholar 

  10. Beer R D. Autopoiesis and Cognition in the Game of Life.Artificial Life, 2004,10(3):309–326.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Foundation item: Supported by the National Grand Fundamental Research 973 Program of China (2004CB318201) and the Natural Science Foundation of Hubei Province (2005ABA257)

Biography: CHEN Jin-cai(1960-), male, Ph. D. Associate professor, research direction: parallel and distributed system, network information storage, multimedin system technology, etc.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin-cai, C., Jiang-ling, Z. & Dan, F. On the behavior characteristics of cellular automata. Wuhan Univ. J. Nat. Sci. 10, 988–992 (2005). https://doi.org/10.1007/BF02832453

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02832453

Key words

CLC number

Navigation