Algebraic Properties of the Block Transformation on Cellular Automata

Cristopher Moore and Arthur A. Drisko

Working Papers from Santa Fe Institute

Abstract: By grouping several sites together into one, a cellular automaton can be transformed into another with more states and a smaller neighborhood; if the neighborhood has just two sites, we can think of the resulting CA rule as a binary operation. We show that if the blocked rule satisfies an identity which holds for a broad class of algebras, then the underlying rule must have essentially the same structure, and must depend only on its leftmost and rightmost inputs; roughly speaking, that the block transformation cannot turn a nonlinear rule into a linear one.

Date: 1995-09
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:wop:safiwp:95-09-080

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().