Inhomogeneous Cellular Automata (INCA)

  • H. Hartman
  • G. Y. Vichniac
Conference paper
Part of the NATO ASI Series book series (volume 20)


A cellular automaton in 2 dimensions, as considered in this paper, consists of a regular array of sites (or cells), with a value, or state (0 or 1) at each site. With an evolution law in discrete time, a cellular automaton is a fully discrete dynamical system. The law is local: the value assumed by any one site at time t + 1 is determined by the values taken at time t by the neighboring sites. (For reviews, see Vichniac, this volume, and references therein.) These systems are homogeneous in the sense that all sites evolve according to the same transition rule.


Boolean Function Cellular Automaton Transition Rule Boolean Network Percolation Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. A. Kauffman, J. Theoret. Biol., 22, 437–467 (1969).CrossRefMathSciNetGoogle Scholar
  2. [2]
    H. Atlan, F. Fogelman-Soulié, J. Salomon, and G. Weisbuch, Cybernet. Systems, 12, 103–121 (1981).CrossRefMathSciNetGoogle Scholar
  3. [3]
    G. Y. Vichniac, Physica 10D, 96–116 (1984).MathSciNetGoogle Scholar
  4. [4]
    T. Toffoli, Physica 10D, 195–204 (1984).MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • H. Hartman
    • 1
  • G. Y. Vichniac
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations