A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Universal pattern generation by cellular automata
Tekijät: Kari J
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2012
Journal: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 429
Aloitussivu: 180
Lopetussivu: 184
Sivujen määrä: 5
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2011.12.037
Tiivistelmä
We construct a reversible, one-dimensional cellular automaton that has the property that a finite initial configuration generates all finite patterns over its state alphabet. We also conjecture that a related cellular automaton satisfies the stronger property that every finite pattern gets generated in every position, so that the forward orbit of the finite initial configuration is dense. (C) 2011 Elsevier B.V. All rights reserved.
We construct a reversible, one-dimensional cellular automaton that has the property that a finite initial configuration generates all finite patterns over its state alphabet. We also conjecture that a related cellular automaton satisfies the stronger property that every finite pattern gets generated in every position, so that the forward orbit of the finite initial configuration is dense. (C) 2011 Elsevier B.V. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali