On Linear Cellular Automata

On Linear Cellular Automata

wolfram cellular automata are considered and their operation is demonstrated using an example of traffic flow simulation. For the class of one-dimensional elementary cellular automata, the concept of linearity is introduced in the language of Zhegalkin operators. An algorithm for finding linear Zheg...

Full description

Saved in:
Bibliographic Details
Published in:Programming and computer software Vol. 50; no. 1; pp. 24 - 30
Main Authors: Kulikov, V. R., Kytmanov, A. A., Poroshin, A. O., Timofeev, I. V., Fedchenko, D. P.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01-02-2024
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Boolean
Cellular automata
Codes
Computer Science
Flow simulation
Linearity
Neighborhoods
Operating Systems
Operators
Programming languages
Quantum dots
Software Engineering
Software Engineering/Programming and Operating Systems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:wolfram cellular automata are considered and their operation is demonstrated using an example of traffic flow simulation. For the class of one-dimensional elementary cellular automata, the concept of linearity is introduced in the language of Zhegalkin operators. An algorithm for finding linear Zhegalkin operators with multipliers of three variables is presented. The algorithm is implemented in Python.
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768824010067