From Boolean circuits to cellular automata with locators-Reference-Cited by-同舟云学术

From Boolean circuits to cellular automata with locators

Published:2022 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications"
language:
Short-container-title:

Author:

Gasanov Elyar Eldarovich^ORCID

Abstract

The report will present a new class of control systems - cellular automata with locators. The difference between cellular automata with locators and cellular automata is that cellular automata with locators can send signals on the air and receive total signals from the air. This feature allows the communication of machines, which can be arbitrarily far apart. It will be shown how such automata can be implemented as physical devices. A number of problems will be presented that can be solved fundamentally faster in a new class of control systems.

Publisher

Keldysh Institute of Applied Mathematics

Reference23 articles.

1. Muller D. E. Complexity in electronic switching circuits // IRE Transactions on ElectronicComputers EC-5-1, 1956. P. 15–19.

2. Лупанов О. Б. Об одном подходе к синтезу управляющих систем принципу локального кодирования // Проблемы кибернетики. 1965. Вып. 14. С. 31–110.

3. Вайнцвайг М. Н. О мощности схем из функциональных элементов // Доклады АН СССР. 1961. Т. 159, вып. 2. С. 320–323.

4. Гашков С. Б. Глубина булевых функций // Проблемы кибернетики. 1978. Вып. 34. С. 265–268.

5. Ложкин С. А. О глубине функций алгебры логики в произвольном полном базисе // Вестник МГУ. Серия 1. Математика и механика. 1996. Вып. 2. С. 80–82.