Two-dimensional Affine Continuous Cellular Automata solving the relaxed density classification problem
Marcin Dembowski , Barbara Wolnik , Witold Bołt , Jan M. Baetens , Bernard De Baets
AbstractThe density classification problem is one of the most studied problems in the context of the computational abilities of cellular automata. Since this problem cannot be solved in the classical sense, we consider a weaker version, by slightly relaxing the assumptions on the output specification. In this paper, we discuss this relaxed problem for twodimensional Affine Continuous Cellular Automata (ACCAs). We focus on finding the most performant rules solving this problem among the density-conserving ones by evaluating ACCAs experimentally for a predefined set of initial configurations.
|Journal series||Journal of Cellular Automata, ISSN 1557-5969, (A 15 pkt)|
|Publication size in sheets||1.05|
|Keywords in English||Density classification problem, continuous cellular automata|
|Score||= 15.0, 24-07-2019, ArticleFromJournal|
|Publication indicators||: 2017 = 0.609; : 2017 = 0.511 (2) - 2017=0.504 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.