Affinity Classification Problem by Stochastic Cellular Automata
Formal Languages and Automata Theory
2022-07-13 v1 Cellular Automata and Lattice Gases
Abstract
This work introduces a new problem, named as, 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 2-dimensional grid having affection capability. We show that this model can be used in several applications like modeling self-healing systems.
Cite
@article{arxiv.2207.05446,
title = {Affinity Classification Problem by Stochastic Cellular Automata},
author = {Kamalika Bhattacharjee and Subrata Paul and Sukanta Das},
journal= {arXiv preprint arXiv:2207.05446},
year = {2022}
}