Advances in the study of elementary cellular automata regular language complexity
| dc.contributor.author | De Oliveira P.P.B. | |
| dc.contributor.author | Ruivo E.L.P. | |
| dc.contributor.author | Costa W.L. | |
| dc.contributor.author | Miki F.T. | |
| dc.contributor.author | Trafaniuc V.V. | |
| dc.date.accessioned | 2024-03-13T00:52:58Z | |
| dc.date.available | 2024-03-13T00:52:58Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | © 2015 Wiley Periodicals, Inc.Cellular automata (CA) are discrete dynamical systems that, out of the fully local action of its state transition rule, are capable of generating a multitude of global patterns, from the trivial to the arbitrarily complex ones. The set of global configurations that can be obtained by iterating a one-dimensional cellular automaton for a finite number of times can always be described by a regular language. The size of the minimum finite automaton corresponding to such a language at a given time step provides a complexity measure of the underlying rule. Here, we study the time evolution of elementary CA, in terms of such a regular language complexity. We review and expand the original results on the topic, describe an alternative method for generating the subsequent finite automata in time, and provide a method to analyze and detect patterns in the complexity growth of the rules. © 2015 Wiley Periodicals, Inc. Complexity 21: 267–279, 2016. | |
| dc.description.firstpage | 267 | |
| dc.description.issuenumber | 6 | |
| dc.description.lastpage | 279 | |
| dc.description.volume | 21 | |
| dc.identifier.doi | 10.1002/cplx.21686 | |
| dc.identifier.issn | 1099-0526 | |
| dc.identifier.uri | https://dspace.mackenzie.br/handle/10899/35959 | |
| dc.relation.ispartof | Complexity | |
| dc.rights | Acesso Restrito | |
| dc.subject.otherlanguage | complexity | |
| dc.subject.otherlanguage | elementary cellular automaton | |
| dc.subject.otherlanguage | finite automaton | |
| dc.subject.otherlanguage | limit behavior | |
| dc.subject.otherlanguage | process graph | |
| dc.subject.otherlanguage | regular language | |
| dc.title | Advances in the study of elementary cellular automata regular language complexity | |
| dc.type | Artigo | |
| local.scopus.citations | 4 | |
| local.scopus.eid | 2-s2.0-84946176934 | |
| local.scopus.updated | 2024-05-01 | |
| local.scopus.url | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84946176934&origin=inward |