One-dimensional Cellular Automata
One-dimensional Cellular Automata
复制标题
一维元胞自动机
DOI:
--
复制
发表时间:
--
期刊:
影响因子:
--
通讯作者:
S. Wolfram
中科院分区:
文献类型:
--
作者:
S. Wolfram
We will consider a lattice network of cells that are most commonly square in shape, but the cells can be hexagonal and other shapes as well. Each cell can exist in k different states, where k is a finite number equal to or greater than 2. One of these states has a special status and will be known as the ‘quiescent state’. The simplest case where each cell can exist in two possible states (not simultaneously), can be denoted by the symbols 0 and 1 and graphically by white and black, respectively. In more anthropomorphic terms, we can think of cells in the 0 (white/quiescent) state as ‘dead’ and those in the 1 (black) state as ‘alive’. The lattice of cells can be n(≥ 1) dimensional, but most of the work on cellular automata has been for one and two dimensions, particularly the former. In the sequel, we shall generally consider square cells as the basic unit of our automata. In the one-dimensional case, these form a row of adjacent boxes. In principle, the number of boxes in any array is infinite, but for practical purposes it will simply be taken sufficiently large to illustrate the behavior in question, often with certain conditions imposed on the cells along the boundaries. In some cases, intentional restrictions will be made on the size of the lattice as well. In order for the cells of our lattice to evolve we need time to change, and this is done in an unusual manner by considering changes to the states