AbstractWe investigate how the choice of the neighborhood can influence the computation ability of two-dimensional cellular automata. We present also a strict inclusion between low and high complexity classes of two-dimensional cellular automata
International audienceThis article deals with cellular automata (CA) working over periodic configura...
Les automates cellulaires sont un modèle de calcul massivement parallèle introduit dans les années 5...
International audienceTopological dynamics of cellular automata (CA), inherited from classical dynam...
The general theory of cellular automata is investigated with special attention to structural complex...
Cellular automata were introduced in the 50s by J. von Neumann and S. Ulamas an efficient way of mod...
AbstractIn this work we consider the relationships between the classes of two-dimensional languages ...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
AbstractIn this paper, multidimensional cellular automaton are considered. We investigate the hierar...
M.Sc. (Computer Science)Astudy of one- and two-dimensional cellular automata was made. Two research ...
During the past several years, a number of papers have appeared on the subject of simulation in cell...
Abstract. Cellular Automata can be considered discrete dynamical sys-tems and at the same time a mod...
In this paper, we consider two-dimensional cellular automata (CA) with the von Neumann neighborhood....
In this report, we present some of the results achieved by investigating two-dimensional monomial ce...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
Cellular automata are a discrete dynamical system which models massively parallel computation. Much ...
International audienceThis article deals with cellular automata (CA) working over periodic configura...
Les automates cellulaires sont un modèle de calcul massivement parallèle introduit dans les années 5...
International audienceTopological dynamics of cellular automata (CA), inherited from classical dynam...
The general theory of cellular automata is investigated with special attention to structural complex...
Cellular automata were introduced in the 50s by J. von Neumann and S. Ulamas an efficient way of mod...
AbstractIn this work we consider the relationships between the classes of two-dimensional languages ...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
AbstractIn this paper, multidimensional cellular automaton are considered. We investigate the hierar...
M.Sc. (Computer Science)Astudy of one- and two-dimensional cellular automata was made. Two research ...
During the past several years, a number of papers have appeared on the subject of simulation in cell...
Abstract. Cellular Automata can be considered discrete dynamical sys-tems and at the same time a mod...
In this paper, we consider two-dimensional cellular automata (CA) with the von Neumann neighborhood....
In this report, we present some of the results achieved by investigating two-dimensional monomial ce...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
Cellular automata are a discrete dynamical system which models massively parallel computation. Much ...
International audienceThis article deals with cellular automata (CA) working over periodic configura...
Les automates cellulaires sont un modèle de calcul massivement parallèle introduit dans les années 5...
International audienceTopological dynamics of cellular automata (CA), inherited from classical dynam...
DOI
Add to ORKG