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

Surjective Cellular Automata Far from the Garden of Eden

Silvio Capobianco, Pierre Guillon, Jarkko Kari, Surjective Cellular Automata Far from the Garden of Eden. Discrete Mathematics & Theoretical Computer Science 15(3), 41–60, 2013.

Abstract:

One of the first and most famous results of cellular automata theory, Moore's Garden-of-Eden theorem has been proven to hold if and only if the underlying group possesses the measure-theoretic properties suggested by von Neumann to be the obstacle to the Banach-Tarski paradox. We show that several other results from the literature, already known to characterize surjective cellular automata in dimension d, hold precisely when the Garden-of-Eden theorem does. We focus in particular on the balancedness theorem, which has been proven by Bartholdi to fail on amenable groups, and we measure the amount of such failure.

BibTeX entry:

@ARTICLE{jCaGuKa13a,
  title = {Surjective Cellular Automata Far from the Garden of Eden},
  author = {Capobianco, Silvio and Guillon, Pierre and Kari, Jarkko},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  volume = {15},
  number = {3},
  pages = {41–60},
  year = {2013},
}

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

Edit publication