A1 Refereed original research article in a scientific journal
Universal pattern generation by cellular automata
Authors: Kari J
Publisher: ELSEVIER SCIENCE BV
Publication year: 2012
Journal: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 429
First page : 180
Last page: 184
Number of pages: 5
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2011.12.037
Abstract
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.
UTU Research Portal