38 search results - page 1 / 8 » On the Expressiveness of Asynchronous Cellular Automata |
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
AUTOMATICA
2008
13 years 3 months ago
2008
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...
ACRI
2008
Springer
13 years 7 months ago
2008
Springer
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...
CONCUR
1998
Springer
13 years 9 months ago
1998
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its ...