Part 2: Regular PapersInternational audienceWe introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; vertex-transitive graphs, in particular, Cayley graphs, acted on by automorphisms; groups acting on themselves by multiplication; and integer lattices acted on by translations
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal sub...
International audienceCayley graphs have a number of useful features: the ability to graphically rep...
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states i...
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of ...
AbstractLet A be a set and let G be a group, and equip AG with its prodiscrete uniform structure. Le...
We introduce the notion of ’Composition’, ’Union ’ and ’Division ’ of cellular automata on groups. A...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-Industry グローバルCOEプログラム「マス・フォア・...
Let G be a finite group and A a finite set. A cellular automaton is a transformation of the configur...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
Abstract: Classical results on the surjectivity and injectivity of parallel maps are shown to be ext...
A cellular automaton (or CA) is an interconnected set of finite state machines (or cells) such that ...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal sub...
International audienceCayley graphs have a number of useful features: the ability to graphically rep...
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states i...
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of ...
AbstractLet A be a set and let G be a group, and equip AG with its prodiscrete uniform structure. Le...
We introduce the notion of ’Composition’, ’Union ’ and ’Division ’ of cellular automata on groups. A...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-Industry グローバルCOEプログラム「マス・フォア・...
Let G be a finite group and A a finite set. A cellular automaton is a transformation of the configur...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
Abstract: Classical results on the surjectivity and injectivity of parallel maps are shown to be ext...
A cellular automaton (or CA) is an interconnected set of finite state machines (or cells) such that ...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal sub...
International audienceCayley graphs have a number of useful features: the ability to graphically rep...
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states i...