Sciweavers

367 search results - page 1 / 74
» Amalgamation of cellular automata
Sort
View
JAC
2008
13 years 6 months ago
Amalgamation of cellular automata
In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgam...
Guillaume Theyssier
AUTOMATICA
2008
198views more  AUTOMATICA 2008»
13 years 3 months ago
Asynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
Hamid Beigy, Mohammad Reza Meybodi
STACS
2005
Springer
13 years 10 months ago
How Common Can Be Universality for Cellular Automata?
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
Guillaume Theyssier
JAC
2008
13 years 6 months ago
Topological properties of sand automata as cellular automata
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology f...
Alberto Dennunzio, Pierre Guillon, Benoît Ma...
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 1 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...