A note on the Density Classification Problem in Two Dimensions

International audienceThe density classification problem is explored experimentally in the case of two-dimensional grids. We compare the performance of deterministic and stochastic CA, as well as interacting particle systems. The question of how to design a rule that would attain an arbitrary precision is examined and we show that it seems more difficult to solve than in the one-dimensional case

A guided tour of asynchronous cellular automata

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat

Searching for pattern-forming asynchronous cellular automata – An evolutionary approach

Abstract. This paper discusses a class of 2-dimensional asynchronous cellular automata with conservation of mass, for the formation of patterns in groups. The previous study reported a methodology of searching, automatically, for pattern-forming cellular automata using a genetic algorithm; this approach successfully found a few types of pattern-forming rules. The current study is a series of statistical analyses of one of the classes found by the above methodology, with the hope of understanding the mechanisms of the pattern formation. These analyses lead to some basic logic necessary to the pattern formation, but not to enough information to elucidate the whole mechanism of the pattern formation. This result suggests that the existence of unidentified cooperative operations between the different transitions of the cellular automaton rule to carry out the pattern formation.