A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Color Blind Cellular Automata
Tekijät: Ville Salo, Ilkka Törmä
Toimittaja: Jarkko Kari, Martin Kutrib, Andreas Malcher
Kustannuspaikka: Berlin
Julkaisuvuosi: 2013
Journal: Lecture Notes in Computer Science
Kokoomateoksen nimi: Cellular Automata and Discrete Complex Systems
Sarjan nimi: Lecture Notes in Computer Science
Vuosikerta: 8155
Aloitussivu: 139
Lopetussivu: 154
Sivujen määrä: 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
Verkko-osoite: http://dx.doi.org/10.1007/978-3-642-40867-0_10
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali