5 research outputs found
Surjective cellular automata far from the Garden of Eden
Automata, Logic and SemanticsInternational audienceOne 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
Surjective cellular automata far from the Garden of Eden
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
Proceedings of AUTOMATA 2010: 16th International workshop on cellular automata and discrete complex systems
International audienceThese local proceedings hold the papers of two catgeories: (a) Short, non-reviewed papers (b) Full paper
Cellular Automata on Group Sets
We introduce and study cellular automata whose cell spaces are
left-homogeneous spaces. Examples of left-homogeneous spaces are spheres,
Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform
tilings acted on by symmetries; vertex-transitive graphs, in particular, Cayley
graphs, acted on by automorphisms; groups acting on themselves by
multiplication; and integer lattices acted on by translations. For such
automata and spaces, we prove, in particular, generalisations of topological
and uniform variants of the Curtis-Hedlund-Lyndon theorem, of the
Tarski-F{\o}lner theorem, and of the Garden-of-Eden theorem on the full shift
and certain subshifts. Moreover, we introduce signal machines that can handle
accumulations of events and using such machines we present a time-optimal
quasi-solution of the firing mob synchronisation problem on finite and
connected graphs.Comment: This is my doctoral dissertation. It consists of extended versions of
the articles arXiv:1603.07271 [math.GR], arXiv:1603.06460 [math.GR],
arXiv:1603.07272 [math.GR], arXiv:1701.02108 [math.GR], arXiv:1706.05827
[math.GR], and arXiv:1706.05893 [cs.FL
Proceedings of AUTOMATA 2011 : 17th International Workshop on Cellular Automata and Discrete Complex Systems
International audienceThe proceedings contain full (reviewed) papers and short (non reviewed) papers that were presented at the workshop