Color Blind Cellular Automata



: Ville Salo, Ilkka Törmä

: Jarkko Kari, Martin Kutrib, Andreas Malcher

: Berlin

: 2013

: Lecture Notes in Computer Science

: Cellular Automata and Discrete Complex Systems

: Lecture Notes in Computer Science

: 8155

: 139

: 154

: 16

: 978-3-642-40866-3

: 978-3-642-40867-0

: 0302-9743

DOI: https://doi.org/10.1007/978-3-642-40867-0_10

: http://dx.doi.org/10.1007/978-3-642-40867-0_10


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.



Last updated on 2024-26-11 at 22:32