DOIAbstract
We investigate the computational capacities of finite and infinite elementary cellular automata in light of their topological dynamics properties
We investigate the computational capacities of finite and infinite elementary cellular automata in light of their topological dynamics properties
Cellular automata are a discrete dynamical system which models massively parallel computation. Much ...
This thesis presents an empirical study of the effects of topology on cellular automata rule spaces....
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
CellularAutomatacanbeconsidereddiscretedynamicalsys- tems and at the same time a model of parallel c...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
AbstractWe study the computational complexity of several problems with the evolution of configuratio...
This volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an autho...
International audienceTopological dynamics of cellular automata (CA), inherited from classical dynam...
AbstractThis article surveys some theoretical aspects of cellular automata CA research. In particula...
This introductory paper gives a short survey of Cellular Automata (CA's), from different points of v...
Abstract Linear cellular automata have a canonical representation in terms of labeled de Bruijn grap...
AbstractCellular Automata can be considered discrete dynamical systems and at the same time a model ...
Abstract. We study computational properties of linear cellular automata on configurations that diffe...
Abstract. A novel algebraic and dynamic systems approach to finite elementary cellular automata is p...
In the qualitative classification of cellular automata (CA) rules by Wolfram [Rev. Mod. Phys. 55, 60...
Cellular automata are a discrete dynamical system which models massively parallel computation. Much ...
This thesis presents an empirical study of the effects of topology on cellular automata rule spaces....
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
CellularAutomatacanbeconsidereddiscretedynamicalsys- tems and at the same time a model of parallel c...
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cel...
AbstractWe study the computational complexity of several problems with the evolution of configuratio...
This volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an autho...
International audienceTopological dynamics of cellular automata (CA), inherited from classical dynam...
AbstractThis article surveys some theoretical aspects of cellular automata CA research. In particula...
This introductory paper gives a short survey of Cellular Automata (CA's), from different points of v...
Abstract Linear cellular automata have a canonical representation in terms of labeled de Bruijn grap...
AbstractCellular Automata can be considered discrete dynamical systems and at the same time a model ...
Abstract. We study computational properties of linear cellular automata on configurations that diffe...
Abstract. A novel algebraic and dynamic systems approach to finite elementary cellular automata is p...
In the qualitative classification of cellular automata (CA) rules by Wolfram [Rev. Mod. Phys. 55, 60...
Cellular automata are a discrete dynamical system which models massively parallel computation. Much ...
This thesis presents an empirical study of the effects of topology on cellular automata rule spaces....
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
Add to ORKG