• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Universal Pattern Generation by Cellular Automata

Jarkko Kari, Universal Pattern Generation by Cellular Automata. Theoretical Computer Science 429, 180–184, 2012.

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.

BibTeX entry:

@ARTICLE{jKari_Jarkko13a,
  title = {Universal Pattern Generation by Cellular Automata},
  author = {Kari, Jarkko},
  journal = {Theoretical Computer Science},
  volume = {429},
  pages = {180–184},
  year = {2012},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication