Permutation Cellular Automata

  • Authors:

  • Camilo Jadur;Masakazu Nasu;Jorge Yazlle

  • Affiliations:

  • Departamento de Matemática, Facultad de Ciencias Exactas, Universidad Nacional de Salta, Salta, Argentina 4400;, Higashi-Hiroshima, Japan 739-2115;Departamento de Matemática, Facultad de Ciencias Exactas, Universidad Nacional de Salta, Salta, Argentina 4400

  • Venue:
  • Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Permutation cellular automata are cellular automata defined by using finite maximal prefix codes. The overall dynamics of onesided and twosided permutation cellular automata is studied. For some classes of permutation cellular automata including the class of those defined by using finite maximal bifix codes, the overall dynamics is completely or partially described in terms of the codes used to define them.