• Corpus ID: 17802038

Odd-Rule Cellular Automata on the Square Grid

@article{Ekhad2015OddRuleCA,
  title={Odd-Rule Cellular Automata on the Square Grid},
  author={Shalosh B. Ekhad and N. J. A. Sloane and Doron Zeilberger},
  journal={arXiv: Combinatorics},
  year={2015}
}
An \odd-rule" cellular automaton (CA) is dened by specifying a neighborhood for each cell, with the rule that a cell turns ON if it is in the neighborhood of an odd number of ON cells at the previous generation, and otherwise turns OFF. We classify all the odd-rule CAs dened 
2 Citations

Figures and Tables from this paper

On the Number of ON Cells in Cellular Automata

If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain \odd-rule" CAs, including Rule 150, Rule 614, and Fredkin’s Replicator, the

A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata

TLDR
A meta-algorithm is developed that produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears as a coefficient when the polynomial is raised to the power n and the coefficients are readmodulo p.

References

SHOWING 1-10 OF 19 REFERENCES

On the Number of ON Cells in Cellular Automata

If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain \odd-rule" CAs, including Rule 150, Rule 614, and Fredkin’s Replicator, the

A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata

TLDR
A meta-algorithm is developed that produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears as a coefficient when the polynomial is raised to the power n and the coefficients are readmodulo p.

Algebraic properties of cellular automata

TLDR
Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata, and the complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities.

Universality and complexity in cellular automata

Two-dimensional cellular automata

A largely phenomenological study of two-dimensional cellular automata is reported. Qualitative classes of behavior similar to those in one-dimensional cellular automata are found. Growth from simple

Theory of cellular automata: A survey

  • J. Kari
  • Computer Science
    Theor. Comput. Sci.
  • 2005

Statistical mechanics of cellular automata

TLDR
Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.

The Toothpick Sequence and Other Sequences from Cellular Automata

A two-dimensional arrangement of toothpicks is constructed by the following iterative procedure. At stage 1, place a single toothpick of length 1 on a square grid, aligned with the y-axis. At each

Growth and Decay in Life-Like Cellular Automata

  • D. Eppstein
  • Computer Science
    Game of Life Cellular Automata
  • 2010
TLDR
This chapter discusses the mathematical systems of cellular automata, the fascinating patterns that have been discovered and engineered in Conway’s Game of Life, and of the possible existence of other cellular automaton rules with equally complex behavior to that of Life.

The On-Line Encyclopedia of Integer Sequences

  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
TLDR
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.