Fast solutions to k-parity and k-synchronisation using parallel automata networks

Tipo
Artigo
Data de publicação
2025
Periódico
Theoretical Computer Science
Citações (Scopus)
0
Autores
Perrotin P.
Ruivo E.
Balbi P.P.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
© 2025 Elsevier B.V.We present a family of automata networks that solve the k-parity problem when run in parallel. These solutions are constructed by connecting cliques in a non-cyclical fashion. The size of the local neighbourhood is linear in the size of the alphabet, and the convergence time is proven to always be the diameter of the interaction graph. We show that this family of solutions can be slightly altered to obtain an equivalent family of solutions to the k-synchronisation problem, which means that these solutions converge from any initial configuration to the cycle which contains all the uniform configurations over the alphabet, in order.
Descrição
Palavras-chave
Assuntos Scopus
Automata networks , Convergence time , Families of solutions , Fast solutions , Interaction graphs , Local neighborhoods , Network convergence , Parallel automaton , Parity problems , Synchronization problem
Citação
DOI (Texto completo)
10.1016/j.tcs.2025.115219
URI
https://dspace.mackenzie.br/handle/10899/40610
Coleções
Artigos de periódico