Add to ORKGAbstract -Various classifications of structures generated by one-dimensional binary cellular automata from a point embryo are presented. The number of classes of automata is calculated for different invariance operations. It is demonstrated that there exist cellular automata with memory and memoryless cellular automata exhibiting the same behavior
International audienceThis paper is the second part of a series of two papers dealing with bulking: ...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
This introductory paper gives a short survey of Cellular Automata (CA's), from different points of v...
The goal of this master thesis is to examine possibilities of realizing comptutational structures in...
Cellular automata, a class of discrete dynamical systems, show a wide range of dynamic behavior, som...
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in...
In order to identify complex systems capable of modeling artificial life, we study the notion of com...
M.Sc. (Computer Science)Astudy of one- and two-dimensional cellular automata was made. Two research ...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
AbstractBased on computer simulations Wolfram presented in several papers conjectured classification...
This paper deals with one approach designing complex biomorphical shapes by means of the evolutional...
AbstractWe study the computational complexity of several problems with the evolution of configuratio...
AbstractThis paper is the second part of a series of two papers dealing with bulking: a way to defin...
"Glider" dynamics in cellular automata (CA), where coherent configurations emerge and inte...
In this paper, we show that the mathematical classification of one-dimensional cellular automata giv...
International audienceThis paper is the second part of a series of two papers dealing with bulking: ...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
This introductory paper gives a short survey of Cellular Automata (CA's), from different points of v...
The goal of this master thesis is to examine possibilities of realizing comptutational structures in...
Cellular automata, a class of discrete dynamical systems, show a wide range of dynamic behavior, som...
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in...
In order to identify complex systems capable of modeling artificial life, we study the notion of com...
M.Sc. (Computer Science)Astudy of one- and two-dimensional cellular automata was made. Two research ...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
AbstractBased on computer simulations Wolfram presented in several papers conjectured classification...
This paper deals with one approach designing complex biomorphical shapes by means of the evolutional...
AbstractWe study the computational complexity of several problems with the evolution of configuratio...
AbstractThis paper is the second part of a series of two papers dealing with bulking: a way to defin...
"Glider" dynamics in cellular automata (CA), where coherent configurations emerge and inte...
In this paper, we show that the mathematical classification of one-dimensional cellular automata giv...
International audienceThis paper is the second part of a series of two papers dealing with bulking: ...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
This introductory paper gives a short survey of Cellular Automata (CA's), from different points of v...