B3 Vertaisarvioimaton artikkeli konferenssijulkaisussa
Pattern Generation by Cellular Automata (Invited Talk)




Julkaisun tekijät: Jarkko Kari
Julkaisuvuosi: 2013
Kirjan nimi *: 24th International Conference on Rewriting Techniques and Applications (RTA 2013)
Sarjan nimi: LIPIcs
Sivujen määrä: 3
ISBN: 978-3-939897-53-8
ISSN: 1868-8969

Tiivistelmä
A one-dimensional cellular automaton is a discrete dynamical system where a sequence of symbols evolves synchronously according to a local update rule. We discuss simple update rules that make the automaton perform multiplications of numbers by a constant. If the constant and the number base are selected suitably the automaton becomes a universal pattern generator: all finite strings over its state alphabet appear from a finite seed. In particular we consider the automata that multiply by constants 3 and 3/2 in base 6. We discuss the connections of these automata to some difficult open questions in number theory, and we pose several further questions concerning pattern generation in cellular automata.


Sisäiset tekijät/toimittajat

Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2019-21-08 at 20:47