A generalized neighborhood for cellular automata

DOI10.1016/j.tcs.2016.11.002zbMath1359.68213OpenAlexW2551937259WikidataQ60692288 ScholiaQ60692288MaRDI QIDQ511006

Dmitry A. Zaitsev

Publication date: 14 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.002

zbMATH Keywords

cellular automataDelannoy numbersChebyshev distancegeneralized neighborhoodManhattan distanceMoore's neighborhoodvon Neumann's neighborhood

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items

Superbinomial coefficients, Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids, Modified von Neumann neighborhood and taxicab geometry-based edge detection technique for infrared images, The influence of migration speed on cooperation in spatial games

Uses Software

• OEIS

Cites Work

• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
• Low complexity classes of multidimensional cellular automata
• Theory of cellular automata: a survey
• Why Delannoy numbers?
• Universality in Infinite Petri Nets
• Colouring Space - A Coloured Framework for Spatial Modelling in Systems Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item