A4 Refereed article in a conference publication
Color Blind Cellular Automata
Authors: Ville Salo, Ilkka Törmä
Editors: Jarkko Kari, Martin Kutrib, Andreas Malcher
Publishing place: Berlin
Publication year: 2013
Journal: Lecture Notes in Computer Science
Book title : Cellular Automata and Discrete Complex Systems
Series title: Lecture Notes in Computer Science
Volume: 8155
First page : 139
Last page: 154
Number of pages: 16
ISBN: 978-3-642-40866-3
eISBN: 978-3-642-40867-0
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-642-40867-0_10
Web address : http://dx.doi.org/10.1007/978-3-642-40867-0_10
Abstract
We introduce the classes of color blind and typhlotic cellular automata, that is, cellular automata that commute with all symbol permutations and all symbol mappings, respectively. We show that color blind cellular automata form a relatively large subclass of all cellular automata which contains an intrinsically universal automaton. On the other hand, we give simple characterizations for the color blind CA which
are also group homomorphisms, and for general typhlotic CA, showing that both must be trivial in most cases.
We introduce the classes of color blind and typhlotic cellular automata, that is, cellular automata that commute with all symbol permutations and all symbol mappings, respectively. We show that color blind cellular automata form a relatively large subclass of all cellular automata which contains an intrinsically universal automaton. On the other hand, we give simple characterizations for the color blind CA which
are also group homomorphisms, and for general typhlotic CA, showing that both must be trivial in most cases.
UTU Research Portal