Towards the classification of all Boolean cellular automata

G.A. Kohring

Physica A: Statistical Mechanics and its Applications, 1992, vol. 182, issue 3, 320-324

Abstract: A classification scheme for all Boolean cellular automata models involving an arbitrary number of inputs is proposed. The scheme is based upon counting the number of stable points for a given rule, i.e., points whose time development is stable with respect to small perturbations. When applied to all cellular automata with 2, 3, 4, or 5 Boolean inputs (the latter involving more than 4000 million cases), it yields, in each case, a nontrivial classification (i.e., there is no single class in which nearly all the rules lie). In addition, it is shown how rules satisfying a given Boolean differential equation can easily be obtained.

Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/037843719290345Q
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:182:y:1992:i:3:p:320-324

DOI: 10.1016/0378-4371(92)90345-Q

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().