We introduce the notion of ’Composition’, ’Union ’ and ’Division ’ of cellular automata on groups. A kind of notions of compositions was investigated by Sato (1994) andManzini (1998) for linear cellular automata, we extend the notion to general cellular automata on groups and investigated their properties. We observe the all unions and compositions generated by one-dimensional 2-neighborhood cellular automata over Z2 including non-linear cellular automata. Next we prove that the composition is right-distributive over union, but is not left-distributive. Finally, we conclude by showing reformulation of our definition of cellular automata on group which admit more than three states. We also show our formulation contains the representation usi...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractLet X be a one-dimensional cellular automaton. A “power of X” is another cellular automaton ...
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of ...
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)...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states i...
Part 2: Regular PapersInternational audienceWe introduce cellular automata whose cell spaces are lef...
(eng) A grouped instance of a cellular automaton (CA) is another one obtained by grouping several st...
Summarization: The filter cellular automaton (CA) introduced by Park, Steiglitz and Thurston is gene...
In this paper, we introduce group structured linear cellular automata which appear naturally in the ...
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal sub...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractLet X be a one-dimensional cellular automaton. A “power of X” is another cellular automaton ...
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of ...
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)...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states i...
Part 2: Regular PapersInternational audienceWe introduce cellular automata whose cell spaces are lef...
(eng) A grouped instance of a cellular automaton (CA) is another one obtained by grouping several st...
Summarization: The filter cellular automaton (CA) introduced by Park, Steiglitz and Thurston is gene...
In this paper, we introduce group structured linear cellular automata which appear naturally in the ...
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal sub...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractLet X be a one-dimensional cellular automaton. A “power of X” is another cellular automaton ...
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of ...