Affinity Classification Problem by Stochastic Cellular Automata
Kamalika Bhattacharjee
Department of Computer Science and Engineering
National Institute of Technology
Tiruchirappalli, Tamilnadu – 620015, India
Subrata Paul
Sukanta Das
Department of Information Technology
Indian Institute of Engineering Science and Technology
Shibpur, Howrah, West Bengal – 711103, India
{kamalika.it, subratapaul.sp.sp}@gmail.com, sukanta@it.iiests.ac.in
Corresponding author
Abstract
This paper introduces the affinity classification problem, which is a generalization of the density classification problem. To solve this problem, we introduce temporally stochastic cellular automata where two rules are stochastically applied in each step on all cells of the automata. Our model is defined on a two-dimensional grid having affection capability. We show that this model can be used in several applications, such as modeling self-healing systems.
Keywords: Cellular Automata (CAs); Stochastic CA; Affinity Classification; Affection; Density Classification; Self-Healing
Cite this publication as:
K. Bhattacharjee, S. Paul and S. Das, “Affinity Classification Problem by Stochastic Cellular Automata,” Complex Systems, 32(3), 2023 pp. 271–288.
https://doi.org/10.25088/ComplexSystems.32.3.271
