On irreversibility of von Neumann additive cellular automata on grids

Authors:
N. Y. Soma;J. P. Melo
Affiliations:
Instituto Tecnológico de Aeronáutica, CTA/ITA/IEC, São José dos Campos, Brazil;Instituto Tecnológico de Aeronáutica, CTA/ITA/IEC, São José dos Campos, Brazil
Venue:
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Year:
2006

Citing 6
Cited 2

On &sgr;-automata

Complex Systems
σ-game, σ+-game and two-dimensional additive cellular automata

Theoretical Computer Science
Multidimensional &sgr;-automata, &pgr;-polynomials and generalised S-matrices

Theoretical Computer Science
&sgr;-Automata and Chebyshev-polynomials

Theoretical Computer Science
On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials

Discrete Applied Mathematics
Concrete Math

Concrete Math

Note: Minimum light number of lit-only σ-game on a tree

Theoretical Computer Science
Does the lit-only restriction make any difference for the σ-game and σ+-game?

European Journal of Combinatorics

Quantified Score

Hi-index	0.01

Visualization

Abstract

The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ+-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ+-automata.