Computing cellular automata spectra under fixed boundary conditions via limit graphs
| dc.contributor.author | Ruivo E.L.P. | |
| dc.contributor.author | De Oliveira P.P.B. | |
| dc.date.accessioned | 2024-03-13T00:52:57Z | |
| dc.date.available | 2024-03-13T00:52:57Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | © 2016 World Scientific Publishing Company.Cellular automata are fully discrete complex systems with parallel and homogeneous behavior studied both from the theoretical and modeling viewpoints. The limit behaviors of such systems are of particular interest, as they give insight into their emerging properties. One possible approach to investigate such limit behaviors is the analysis of the growth of graphs describing the finite time behavior of a rule in order to infer its limit behavior. Another possibility is to study the Fourier spectrum describing the average limit configurations obtained by a rule. While the former approach gives the characterization of the limit configurations of a rule, the latter yields a qualitative and quantitative characterisation of how often particular blocks of states are present in these limit configurations. Since both approaches are closely related, it is tempting to use one to obtain information about the other. Here, limit graphs are automatically adjusted by configurations directly generated by their respective rules, and use the graphs to compute the spectra of their rules. We rely on a set of elementary cellular automata rules, on lattices with fixed boundary condition, and show that our approach is a more reliable alternative to a previously described method from the literature. | |
| dc.description.issuenumber | 7 | |
| dc.description.volume | 27 | |
| dc.identifier.doi | 10.1142/S012918311650073X | |
| dc.identifier.issn | 0129-1831 | |
| dc.identifier.uri | https://dspace.mackenzie.br/handle/10899/35958 | |
| dc.relation.ispartof | International Journal of Modern Physics C | |
| dc.rights | Acesso Restrito | |
| dc.subject.otherlanguage | complexity | |
| dc.subject.otherlanguage | Elementary cellular automata | |
| dc.subject.otherlanguage | finite automata | |
| dc.subject.otherlanguage | Fourier spectrum | |
| dc.subject.otherlanguage | limit language | |
| dc.subject.otherlanguage | process graph | |
| dc.title | Computing cellular automata spectra under fixed boundary conditions via limit graphs | |
| dc.type | Artigo | |
| local.scopus.citations | 0 | |
| local.scopus.eid | 2-s2.0-84971264803 | |
| local.scopus.updated | 2024-05-01 | |
| local.scopus.url | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84971264803&origin=inward |