Skip to main content
Springer Nature Link
Log in

Algebraic Properties of Cellular Automata: The Basis for Composition Technique

  • Conference paper
Cellular Automata (ACRI 2004)

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

Included in the following conference series:

Abstract

An extended class of Cellular Automata (CA), in which arbitrary transition functions are allowed, are considered as a model for spatial dynamic simulation. CA are represented as operators over a set of cellular arrays, where binary operations (superposition, addition and multiplication) are defined. The algebraic properties of the operations are studied. The aim of the investigation is to create a formal basis for the CA composition methods, which are also presented in brief.

Supported by Presidium of Russian Academy of Sciences, Basic Research Program N 17-6 (2004)

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Wolfram, S.: A New Kind of Science, p. 1200. Wolfram Media Inc., Champaign (2002)

    Google Scholar 

  2. Weimar, J.R.: Cellular Automata for Reaction-Diffusion Systems. Parallel Computing 23(11), 1699–1715 (1999)

    Article  MathSciNet  Google Scholar 

  3. Bandman, O.: Simulation Spatial Dynamics by Probabilistic Cellular Automata. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 10–19. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Bandman, O.: Accuracy and Stability of Spatial Dynamics Simulation by Cellular Automata. LNCS, vol. 2766, pp. 20–34. Springer, Heidelberg (2003)

    Google Scholar 

  5. Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm. Theory and Application, p. 180. World Scientific, Singapore (1994)

    MATH  Google Scholar 

  6. Toffolli, T., Margolus, N.: Cellular Automata Machines, vol. 280, p. 210. MIT Press, USA (1987)

    Google Scholar 

  7. Malinetski, G.G., Stepantsov, M.E.: Modelling diffusive processes by cellular automata with Margolus neighborhood. Zh. Vychislitelnoy matematiki i matematicheskoy phiziki 36(6), 1017–1021 (1998)

    Google Scholar 

  8. Schlogl, F.: Chemical reaction models for non-equilibrium phase transitions. Zh. Physik 253, 147–161 (1972)

    Article  Google Scholar 

  9. Weimar, J.R.: Coupling Microscopic and Macroscopic Cellular Automata. Parallel Computing 27(20-01), 601–611 (2001)

    Article  MATH  Google Scholar 

  10. Latkin, E.I., Elokhin, V.I., Gorodetskii, V.V.: Spiral cocentration waves in the Monte-Carlo Model of CO oxidation over PD(110) caused by synchronization via COads diffusion between separate parts of catalitic surface. Chemical Engineering Journal 91, 123–131 (2003)

    Article  Google Scholar 

  11. Park, J.K., Steiglitz, K., Thurston, W.P.: Soliton-like behavior in automata. Physica D 19, 423–432 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Supercomputer Software Department, ICMMG, Siberian Branch Russian Academy of Sciences, Pr. Lavrentieva, 6, Novosibirsk, 630090, Russia

    Olga Bandman

Authors
  1. Olga Bandman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bandman, O. (2004). Algebraic Properties of Cellular Automata: The Basis for Composition Technique. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics