A4 Refereed article in a conference publication
Surjective Two-Neighbor Cellular Automata on Prime Alphabets
Authors: Jarkko Kari, Ville Salo, Ilkka Törmä
Editors: Jarkko Kari, Martin Kutrib, Andreas Malcher
Publishing place: Giessen
Publication year: 2013
Journal: IFIG Research Reports
Book title : Proceedings 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013): Exploratory Papers
Series title: IFIG Research Reports
First page : 31
Last page: 38
Number of pages: 8
Web address : http://www.informatik.uni-giessen.de/reports/Report1302.pdf
Abstract
In this article, we present a simple proof for the fact that a surjective cellular automaton with neighborhood size 2 on a prime alphabet is permutive in some coordinate. We discuss the optimality of this result, and the existence of non-closing cellular automata of a given neighborhood and alphabet size.
In this article, we present a simple proof for the fact that a surjective cellular automaton with neighborhood size 2 on a prime alphabet is permutive in some coordinate. We discuss the optimality of this result, and the existence of non-closing cellular automata of a given neighborhood and alphabet size.
UTU Research Portal