Affine continuous cellular automata solving the fixed-length density classification problem

Marcin Dembowski , Barbara Wolnik , Witold Bołt , Jan M. Baetens , Bernard De Baets


In this paper, the classical density classification problem is considered in the context of affine continuous cellular automata. It has been shown earlier that there exists no general solution to this problem that is valid for any number of cells. Here, we consider this problem in the case of a fixed number of cells. Necessary conditions for solving the problem are formulated. Based on this knowledge, a specific class of affine continuous cellular automata is evaluated experimentally for 23 cells. A rich solution set is analysed and visualised.
Author Marcin Dembowski (FMPI / IM)
Marcin Dembowski ,,
- Institute of Mathematics
, Barbara Wolnik (FMPI / IM)
Barbara Wolnik,,
- Institute of Mathematics
, Witold Bołt
Witold Bołt ,,
, Jan M. Baetens
Jan M. Baetens,,
, Bernard De Baets
Bernard De Baets,,
Journal seriesNatural Computing, ISSN 1567-7818, (A 25 pkt)
Issue year2018
Publication size in sheets0.5
Keywords in Englishdensity classification problem, affine continuous cellular automata, majority problem
ASJC Classification1706 Computer Science Applications
Languageen angielski
Score (nominal)25
ScoreMinisterial score = 25.0, 24-07-2019, ArticleFromJournal
Publication indicators Scopus SNIP (Source Normalised Impact per Paper): 2017 = 0.869; WoS Impact Factor: 2017 = 0.86 (2) - 2017=0.963 (5)
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.