论文信息 - A note on the Density Classification Problem in Two Dimensions

A note on the Density Classification Problem in Two Dimensions

The 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.

Nazim Fatès

[1] Nazim Fatès,et al. Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems , 2008, J. Cell. Autom..

[2] Véronique Terrier. Low complexity classes of multidimensional cellular automata , 2006, Theor. Comput. Sci..

[3] Larry Bull,et al. A very effective density classifier two-dimensional cellular automaton with memory , 2009 .

[4] Enrico Formenti,et al. Decidable Properties of 2D Cellular Automata , 2008, Developments in Language Theory.

[5] Tomoaki Suzudo,et al. Searching for Pattern-Forming Asynchronous Cellular Automata - An Evolutionary Approach , 2004, ACRI.

[6] Land,et al. No perfect two-state cellular automata for density classification exists. , 1995, Physical review letters.

[7] R. L. Dobrushin,et al. Stochastic cellular systems : ergodicity, memory, morphogenesis , 1990 .

[8] Rene Reynaga,et al. Two-dimensional cellular automata of radius one for density classification task p=1/2 , 2003, Pattern Recognit. Lett..

[9] Ana Busic,et al. Density Classification on Infinite Lattices and Trees , 2011, LATIN.