Abstract: We consider one-dimensional grids Gn = {0, 1, . . . , n - 1}, (where n is a positive odd integer) with periodic boundary condition and with the state set Q = {0, 1}. We are interested in finding a local rule with the smallest possible radius that can correctly classify each initial configuration according to its parity
International audienceWe study the complexity of signed majority cellular automata on the planar gri...
Abstract. We systematically study the boundaries of one-dimensional, 2-color cellular automata depen...
In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initia...
Abstract: We consider one-dimensional cellular automata whose cells can use different local rules to...
Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of...
The Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence...
In the parity problem, a given cellular automaton has to classify any initial configuration into two...
International audienceν-CA are cellular automata which can have different local rules at each site o...
AbstractIn this paper we obtain the following two results about one-dimensional tessellation automat...
Part 2: Regular PapersInternational audienceThe density classification task is to determine which of...
Abstract. We study computational properties of linear cellular automata on configurations that diffe...
AbstractThis paper reports characterization of one dimensional 3-neighborhood periodic boundary cell...
This paper is concerned with the study of six rules from the family of square Boolean cellular autom...
International audienceThis article deals with cellular automata (CA) working over periodic configura...
International audienceWe study the complexity of signed majority cellular automata on the planar gri...
Abstract. We systematically study the boundaries of one-dimensional, 2-color cellular automata depen...
In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initia...
Abstract: We consider one-dimensional cellular automata whose cells can use different local rules to...
Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of...
The Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence...
In the parity problem, a given cellular automaton has to classify any initial configuration into two...
International audienceν-CA are cellular automata which can have different local rules at each site o...
AbstractIn this paper we obtain the following two results about one-dimensional tessellation automat...
Part 2: Regular PapersInternational audienceThe density classification task is to determine which of...
Abstract. We study computational properties of linear cellular automata on configurations that diffe...
AbstractThis paper reports characterization of one dimensional 3-neighborhood periodic boundary cell...
This paper is concerned with the study of six rules from the family of square Boolean cellular autom...
International audienceThis article deals with cellular automata (CA) working over periodic configura...
International audienceWe study the complexity of signed majority cellular automata on the planar gri...
Abstract. We systematically study the boundaries of one-dimensional, 2-color cellular automata depen...
In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
DOI
Add to ORKG