Modeling Boolean circuits using cellular automata with locators
Received: 28 Oct 2026 Revised: 02 Nov 2026 Accepted: 04 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 202–205
Abstract
This paper proposes a method for simulating Boolean circuits using cellular automata with locators (CALs). Given a CFE with \(k\) elements and a depth of \(d\), the corresponding CAL that simulates it will have a delay of \(4d+1\) and an area on the order of \(k^2\).
Keywords: Boolean circuits, cellular automata with locators.
BibTeX
@article{IS-Gasanov-Kalachev-Bukharina2026,
author = {Gasanov, Elyar Eldarovich and Kalachev, Gleb Vyacheslavovich and Bukharina, Daria Anatolevna},
title = {{Modeling Boolean circuits using cellular automata with locators}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {202--205},
}
AMSBIB
\Bibitem{IS-Gasanov-Kalachev-Bukharina2026}
\by E.\,E.~Gasanov, G.\,V.~Kalachev, D.\,A.~Bukharina
\paper Modeling Boolean circuits using cellular automata with locators
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 202--205
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU