Title
Affine continuous cellular automata solving the fixed-length density classification problem.
Abstract
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.
Year
DOI
Venue
2018
10.1007/s11047-017-9631-4
Natural Computing
Keywords
Field
DocType
Density classification problem,Affine continuous cellular automata,Majority problem
Affine transformation,Discrete mathematics,Cellular automaton,Continuous spatial automaton,Affine combination,Algebra,Existential quantification,Solution set,Majority problem,Stochastic cellular automaton,Mathematics
Journal
Volume
Issue
ISSN
17
3
1567-7818
Citations 
PageRank 
References 
0
0.34
8
Authors
5
Name
Order
Citations
PageRank
Marcin Dembowski100.34
Barbara Wolnik223.43
Witold Bolt342.80
Jan M. Baetens4267.65
Bernard De Baets52994300.39