<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="oration" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Informacionnye Tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Informacionnye Tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Информационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1684-6400</issn><publisher><publisher-name xml:lang="en">New Technologies Publishing House</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">702325</article-id><article-id pub-id-type="doi">10.17587/it.30.571-578</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Conference Report, Theses of Report</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Matrix model of deterministic synchronous cellular automata</article-title><trans-title-group xml:lang="ru"><trans-title>Моделирование синхронных детерминированных клеточных автоматов матрицами</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Matolygina</surname><given-names>N. A.</given-names></name><name xml:lang="ru"><surname>Матолыгина</surname><given-names>Н. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Laboratory Assistant</p></bio><bio xml:lang="ru"><p>лаборант</p></bio><email>nat.shalyapina@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Gromov</surname><given-names>M. L.</given-names></name><name xml:lang="ru"><surname>Громов</surname><given-names>М. Л.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>PhD, Associate Professor</p></bio><bio xml:lang="ru"><p>канд. физ.-мат. наук, доц.</p></bio><email>gromov@mail.tsu.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Tomsk State University</institution></aff><aff><institution xml:lang="ru">Национальный исследовательский Томский государственный университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-11-15" publication-format="electronic"><day>15</day><month>11</month><year>2024</year></pub-date><volume>30</volume><issue>11</issue><issue-title xml:lang="ru">Информационные технологии</issue-title><fpage>571</fpage><lpage>578</lpage><history><date date-type="received" iso-8601-date="2026-02-07"><day>07</day><month>02</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-02-07"><day>07</day><month>02</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Informacionnye Tehnologii</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Информационные технологии</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Informacionnye Tehnologii</copyright-holder><copyright-holder xml:lang="ru">Информационные технологии</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/1684-6400/article/view/702325">https://journals.eco-vector.com/1684-6400/article/view/702325</self-uri><abstract xml:lang="en"><p>The paper presents an approach for modeling deterministic synchronous cellular automata by matrices and operations on them. It is proposed to renumber the states of the automaton and write down a matrix, the elements of which are the current states (numbers associated with them) of the cells of the automaton. It is proposed to calculate the matrix of cell states in the next cycle in two stages: find the convolution of the current matrix with a special core, and map the resulting convolution matrix into the matrix of cell states in the next cycle. The convolution core is determined by the cell neighborhood pattern, and the convolution mapping to the matrix of the following states is based on the transition function of the automaton.</p></abstract><trans-abstract xml:lang="ru"><p>Представлен подход для моделирования детерминированных синхронных автоматов матрицами и операциями над ними. Предлагается перенумеровать состояния автомата и записать матрицу, элементы которой — текущие состояния (привязанные к ним числа) клеток автомата. Вычисление матрицы состояний клеток на следующем такте предлагается выполнять в два этапа: найти свертку текущей матрицы со специальным ядром и отобразить полученную матрицу-свертку в матрицу состояний клеток на следующем такте. Ядро свертки определяется шаблоном соседства клеток, а отображение свертки в матрицу следующих состояний строится по функции переходов автомата.</p></trans-abstract><kwd-group xml:lang="en"><kwd>cellular automaton</kwd><kwd>matrix</kwd><kwd>matrix convolution</kwd><kwd>mathematical modeling</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>клеточный автомат</kwd><kwd>матрица</kwd><kwd>свертка матриц</kwd><kwd>математическое моделирование</kwd></kwd-group><funding-group><funding-statement xml:lang="en">The work was carried out with the financial support of the Russian Foundation for Basic Research within the framework of the scientific project No. 20-31-90070 Graduate Students.</funding-statement><funding-statement xml:lang="ru">Работа выполнена при финансовой поддержке РФФИ в рамках научного проекта № 20-31-90070 Аспиранты.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Von Neumann J. Theory of Self-reproducing Automata, Urbana and London, University of Illinois Press, 1966, 403 p.</mixed-citation><mixed-citation xml:lang="ru">Von Neumann J. Theory of Self-reproducing Automata. Urbana and London: University of Illinois Press, 1966, 403 p.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Toffolli T. Cellular Automata Machines, Cambridge, Massachusetts and London, The MIT Press, 1987, 279 p.</mixed-citation><mixed-citation xml:lang="ru">Toffolli T., Margolus N. Cellular Automata Machines. Cambridge, Massachusetts and London: The MIT Press, 1987, 279 p.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Hardy J., Pomeau Y., de Pazzis O. 2D Lattice-Gas model, J. Math. Phys., 1973, no. 14, pp. 1746.</mixed-citation><mixed-citation xml:lang="ru">Hardy J., Pomeau Y., de Pazzis O. 2D Lattice-Gas model // J. Math. Phys. 1973. N. 14. P. 1746.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Bandman O. L. The method of constructing cellular automaton models of the processes of formation of stable structures, Priklandaya diskretnaya matematika, 2010, no. 4, pp. 91—99 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Бандман О. Л. Метод построения клеточно-автоматных моделей процессов формирования устойчивых структур // Прикладная дискретная математика. 2010. № 4. С. 91—99.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Medvedev Yu. G. Application of a cellular automaton model of viscous fluid flow in the study of three-dimensional porous media, Avtometriya, 2006, vol. 42, no. 3, pp. 21—31 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Медведев Ю. Г. Применение клеточно-автоматной модели потока вязкой жидкости в исследовании трехмерных пористых сред // Автометрия. 2006. Т. 42, № 3. С. 21—31.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Malinetskii G. G., Stepantsov M. E. Simulation of diffusion processes using cellular automata with Margolus neighborhood, Zhurnal vychislitelnoi matematiki i matematicheskoi fiziki, 1999, vol. 38, no. 6, pp. 1017—1020 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Малинецкий Г. Г., Степанцов М. Е. Моделирование диффузионных процессов с помощью клеточных автоматов с окрестностью // Журнал вычислительной математики и математической физики. 1999. Т. 38, № 6. С. 1017—1020.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Ochoa Bique A. O., Goryunov A. G., Manenti F. A comparison of simulation techniques for uranium crystallization process, Chemical engineering transactions, 2015, vol. 43, pp. 793—798.</mixed-citation><mixed-citation xml:lang="ru">Ochoa Bique A. O., Goryunov A. G., Manenti F. A comparison of simulation techniques for uranium crystallization process // Chemical engineering transactions. 2015. Vol. 43. P. 793—798.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Batani D., Biava S., Bittanti S., Previdi F. A cellular automaton model of laser—plasma interactions, Laser and Particle Beams, 2001, vol. 19, iss. 04, pp. 631—642.</mixed-citation><mixed-citation xml:lang="ru">Batani D., Biava S., Bittanti S., Previdi F. A cellular automaton model of laser—plasma interactions // Laser and Particle Beams. 2001. Vol. 19, Iss. 04. P. 631—642.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang L., Shiri S., Garoni T. M. A Study of Aggregated Speed in Road Networks Using Cellular Automata, Lecture Notes in Computer Science, 2014, vol. 8751, pp. 596—605.</mixed-citation><mixed-citation xml:lang="ru">Zhang L., Shiri S., Garoni T. M. A Study of Aggregated Speed in Road Networks Using Cellular Automata // ACRI 2014. Lecture Notes in Computer Science. 2014. Vol. 8751. P. 596—605.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Sabelfeld K. K., Kireeva A. A. Parallel implementation of a stochastic cellular automaton model of electron and hole recombination in 2D and 3D inhomogeneous semiconductors, Vestnik YuUrGU. Seriya: Vychislitelnaya matematika i informatika, 2017, vol. 6, no 1, pp. 87—103.</mixed-citation><mixed-citation xml:lang="ru">Сабельфельд К. К., Киреева А. Е. Параллельная реализация стохастической клеточно-автоматной модели рекомбинации электронов и дырок в 2D и 3D неоднородных полупроводниках // Вестник ЮУрГУ. Серия: Вычислительная математика и информатика. 2017. Т. 6, № 1. С. 87—103.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Gibson M., Keedwell Ed., Savic D. An investigation of the efficient implementation of Cellular Automata on multi-core CPU and GPU hardware, Journal of Parallel and Distributed Computing, 2015, vol. 77, pp. 11—25.</mixed-citation><mixed-citation xml:lang="ru">Gibson M., Keedwell Ed., Savic D. An investigation of the efficient implementation of Cellular Automata on multi-core CPU and GPU hardware // Journal of Parallel and Distributed Computing. 2015. Vol. 77. P. 11—25.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Szkoda S., Koza Z., Tykierko M. Accelerating cellular automata simulations using AVX and CUDA, ARXIV, 2012, URL: https://arxiv.org/abs/1208.2428 (access date: 02.08.2024).</mixed-citation><mixed-citation xml:lang="ru">Szkoda S., Koza Z., Tykierko M. Accelerating cellular automata simulations using AVX and CUDA // ARXIV. 2012. [Электронный ресурс]. URL: https://arxiv.org/abs/1208.2428 (дата обращения: 02.08.2024).</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Shalyapina N. A., Gromov M. L. "LIFE" in tensors: modeling cellular automata using video cards, Trudy ISP RAN, 2019, vol. 31, iss. 3, pp. 217—228, doi: 10.15514/ISPRAS-2019-31(3)-17 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Шаляпина Н. А., Громов М. Л. "ЖИЗНЬ" в тензорах: моделирование клеточных автоматов с помощью видеокарт // Труды ИСП РАН. 2019. Т. 31, Вып. 3. С. 217—228. DOI: 10.15514/ISPRAS-2019-31(3)-17.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">14. Subbotina A. Yu., Khokhlov N. I. Implementation of cellular automata "the game of Life" and the Kohomoto—Oono cellular automaton using technology MPI, Komputirnye issledovania i modelirovanie, 2010, vol. 2, no. 3, pp. 319—322 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Субботина А. Ю., Хохлов Н. И. Реализация клеточных автоматов "игра "Жизнь"" и клеточного автомата Кохомото—Ооно с применением технологии MPI // Компьютерные исследования и моделирование. 2010. Т. 2, № 3. С. 319—322</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Kalgin K. V. Parallel implementation of asynchronous cellular automata on a 32-core computer system, Sibirskii zhurnal vychislitelnoi matematiki, 2012, vol. 15, no. 1, pp. 55—65 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Калгин К. В. Параллельная реализация асинхронных клеточных автоматов на 32-ядерной вычислительной системе // Сибирский журнал вычислительной математики. 2012. Т. 15, № 1. С. 55—65.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Szkoda S., Koza Z., Tykierko M. Multi-GPGPU Cellular Automata Simulations using OpenACC, Zenodo, 2014, pp. 1—6.</mixed-citation><mixed-citation xml:lang="ru">Szkoda S., Koza Z., Tykierko M. Multi-GPGPU Cellular Automata Simulations using OpenACC // Zenodo. 2014. P.1—6.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Malyshkin V. Active Knowledge, LuNA and Literacy for Oncoming Centuries, Lecture Notes in Computer Science, 2015, vol. 9465, pp. 292—303.</mixed-citation><mixed-citation xml:lang="ru">Malyshkin V. Active Knowledge, LuNA and Literacy for Oncoming Centuries // LNCS. 2015. Vol. 9465. P. 292—303.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">Perepelkin V. A. LuNA system for automatic construction of numerical parallel programs for multicomputers, Problems of Informatics, 2022, no 1, pp. 1—9.</mixed-citation><mixed-citation xml:lang="ru">Perepelkin V. A. LuNA system for automatic construction of numerical parallel programs for multicomputers // Problems of Informatics. 2022. N. 1. P. 1—9.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">Markova V. P., Ostapkevich M. B. The comparison of MPI and LuNA capabilities using the implementation of cellular automata wave interference, Problems of Informatics, 2017, no. 2, pp. 53—64.</mixed-citation><mixed-citation xml:lang="ru">Markova V. P., Ostapkevich M. B. The comparison of mpi and LuNA capabilities using the implementation of cellular automata wave interference // Problems of Informatics. 2017. N. 2. P. 53—64.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">Matolygina N. A., Gromov M. L., Matolygin A. K. Application of the tensor approach to the software implementation of the cellular automaton flow model, Problemy informatiki, 2023, no. 2, pp. 74—85 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">20. Матолыгина Н. А., Громов М. Л., Матолыгин А. К. Применение тензорного подхода к программной реализации клеточно-автоматной модели потока // Проблемы информатики. 2023. № 2. С. 74—85.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">Gromov M., Shalyapina N., Matolygin A. Representation of Particle Shift in the FHP Model by TensorFlow Operations, Proceedings of International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), 2019, pp. 90—92.</mixed-citation><mixed-citation xml:lang="ru">Gromov M., Shalyapina N., Matolygin A. Representation of Particle Shift in the FHP Model by TensorFlow Operations // Proceedings of International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2019. P. 90—92.</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">Matolygin A. K., Shalyapina N. A., Gromov M. L., Torgaev S. N. Tensor approach to software implementation of cellular automata model of diffusion, J. Phys.: Conf. Ser., 2020, vol. 1680, pp. 1—6.</mixed-citation><mixed-citation xml:lang="ru">Matolygin A. K., Shalyapina N. A., Gromov M. L., Torgaev S. N. Tensor approach to software implementation of cellular automata model of diffusion // J. Phys.: Conf. Ser. 2020. Vol. 1680. P. 1—6.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><citation-alternatives><mixed-citation xml:lang="en">TensorFlow, URL: https://www.tensorflow.org (access date: 01.08.2024).</mixed-citation><mixed-citation xml:lang="ru">TensorFlow [Электронный ресурс]. URL: https://www. tensorflow.org (дата обращения: 01.08.2024).</mixed-citation></citation-alternatives></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Moore E. F. Gedanken-experiments on sequential machines, Automata Studies, ed. C. Shannon and J. McCarthy, Princeton, Princeton University Press, 1956, vol. 34, pp. 129—153.</mixed-citation><mixed-citation xml:lang="ru">Moore E. F. Gedanken-experiments on sequential machines, in C. Shannon and J. McCarthy ed // Automata Studies. 1956. Vol. 34. P. 129—153.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">Gardner M. The fantastic combinations of John Conway’s new solitaire game "Life", Scientific American, 1970, vol. 223, no. 4, pp. 120—123.</mixed-citation><mixed-citation xml:lang="ru">Gardner M. The fantastic combinations of John Conway’s new solitaire game "Life" // Scientific American. 1970. Vol. 223, N. 4. P. 120—123.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">Domasevich M. A., Rubtsov S. E., Pavlova A. V. Implementation of KA models of physical processes on triangulation grids, Ekologicheskii vestnik nauchnykh tsentrov ChES, 2020, vol. 17, no. 3, pp. 13—21 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">М. А., Рубцов С. Е., Павлова А. В. Реализация КА-моделей физических процессов на триангуляционных сетках // Экологический вестник научных центров ЧЭС. 2020. Т. 17, № 3. С. 13—21.</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">Frisch U., Hasslacher B., Pomeau Y. Lattice-Gas automata for Navier-Stokes equations, Phys. Rev. Lett., 1986, vol. 56, no. 14, pp. 1505—1508.</mixed-citation><mixed-citation xml:lang="ru">Frisch U., Hasslacher B., Pomeau Y. Lattice-Gas automata for Navier-Stokes equations // Phys. Rev. Lett. 1986. Vol. 56, N. 14. P. 1505—1508.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
