Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
Tipo
Artigo
Data de publicação
2022
Periódico
Communications in Nonlinear Science and Numerical Simulation
Citações (Scopus)
0
Autores
Balbi P.P.
de Mattos T.
Ruivo E.
de Mattos T.
Ruivo E.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
© 2021 Elsevier B.V.Classically, cellular automata and, in fact, automata networks in general, have synchronous dynamics defined by a local function. But the interest on asynchronous versions of both systems has grown, since it provides an extra degree of freedom. The standard way to define deterministic asynchronism is to set an update priority to each node. It has been shown that these networks can solve problems that were not previously solvable with synchronous systems. However, such a way to define asynchronism depends totally on the relative position of the node in the network. Here, we propose a new way to look at asynchronism in such systems, in that the priority now relies on the state transitions of the system's underlying local function. This leads to a scalable way to add deterministic asynchronism in such networks. Taking the elementary cellular automata space as a baseline, we carry out a complete characterisation of its dynamics using the proposed asynchronism update scheme.
Descrição
Palavras-chave
Assuntos Scopus
Asynchronous version , Automata networks , Cellular automatons , Deterministics , Elementary cellular automaton , Local functions , Neighbourhood , Priority-based , Synchronous dynamics , Synchronous system