Counting the number of points on a plane using cellular automata with locators
Received: 25 Oct 2026 Revised: 27 Oct 2026 Accepted: 02 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 79–82
Abstract
Points are scattered across a plane. The task is to count the number of points and provide the result in binary form. It has been shown that this problem can be solved using two-dimensional cellular automata with locators, in a time not exceeding \(2]\log _2 n[ + 7\), where \(n\) is the number of scattered points.
Keywords: counting the number of points, cellular automata with locators.
BibTeX
@article{IS-Gasanov-Bobrov2026,
author = {Gasanov, Elyar Eldarovich and Bobrov, Alexej Evgenevich},
title = {{Counting the number of points on a plane using cellular automata with locators}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {79--82},
}
AMSBIB
\Bibitem{IS-Gasanov-Bobrov2026}
\by E.\,E.~Gasanov, A.\,E.~Bobrov
\paper Counting the number of points on a plane using cellular automata with locators
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 79--82
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU