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

Página do item simplificado
dc.contributor.authorPerrotin P.
dc.contributor.authorRuivo E.
dc.contributor.authorBalbi P.P.
dc.date.accessioned2025-05-01T06:24:16Z
dc.date.available2025-05-01T06:24:16Z
dc.date.issued2025
dc.description.abstract© 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.
dc.description.volume1041
dc.identifier.doi10.1016/j.tcs.2025.115219
dc.identifier.issnNone
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/40610
dc.relation.ispartofTheoretical Computer Science
dc.rightsAcesso Restrito
dc.subject.otherlanguageAutomata networks
dc.subject.otherlanguageNetwork convergence
dc.subject.otherlanguageParity problem
dc.subject.otherlanguageSynchronisation problem
dc.titleFast solutions to k-parity and k-synchronisation using parallel automata networks
dc.typeArtigo
local.scopus.citations0
local.scopus.eid2-s2.0-105001977997
local.scopus.subjectAutomata networks
local.scopus.subjectConvergence time
local.scopus.subjectFamilies of solutions
local.scopus.subjectFast solutions
local.scopus.subjectInteraction graphs
local.scopus.subjectLocal neighborhoods
local.scopus.subjectNetwork convergence
local.scopus.subjectParallel automaton
local.scopus.subjectParity problems
local.scopus.subjectSynchronization problem
local.scopus.updated2025-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105001977997&origin=inward
Arquivos
Coleções
Artigos de periódico