A generalized neighborhood for cellular automata

Citation data:

Theoretical Computer Science, ISSN: 0304-3975, Vol: 666, Page: 21-35

Publication Year:
2017
Usage 33
Abstract Views 32
Link-outs 1
Captures 7
Readers 7
Social Media 2
Tweets 2
Citations 5
Citation Indexes 5
DOI:
10.1016/j.tcs.2016.11.002
Author(s):
Dmitry A. Zaitsev
Publisher(s):
Elsevier BV
Tags:
Mathematics; Computer Science
Most Recent Tweet View All Tweets
article description
A generalized neighborhood for d -dimensional cellular automata is introduced; it spans the range from von Neumann's to Moore's neighborhood using a parameter which represents the dimension of hypercubes connecting neighboring cells. Finite hypercubes and hypertoruses are studied, and the number of neighbors on their boundary and the number of connections between cells are calculated. We come to finite constructs when practically implementing computations of cellular automata. Enumerations of cells, neighbors and connections are considered and implemented in ad-hoc software which generates a canvas of hypercube and hypertorus models in the form of a Petri net. A cell model can be replaced while the underlying canvas of connections remains the same. The generalized neighborhood is extended to include a concept of radius; the number of neighbors is calculated for infinite and finite lattices. For diamond-shaped neighborhoods, a sequence is obtained whose partial sums equal Delannoy numbers.