|
Descripción
|
|
|---|---|
| In cellular automata (CAs) with memory, the unchanged maps of conventional CAs are applied to cells endowed with memory of their past states in some specified interval. We implement the rule 30 automaton and show that by using the majority memory function we can transform the quasi-chaotic dynamics of classical rule 30 into domains of traveling structures with predictable behavior. We analyze morphological complexity of the automata and classify glider dynamics (particle, self-localizations) in the memory-enriched rule 30. Formal ways of encoding and classifying glider dynamics using de Bruijn diagrams, soliton reactions, and quasi-chemical representations are provided. | |
|
Internacional
|
Si |
|
JCR del ISI
|
No |
|
Título de la revista
|
Complex Systems |
|
ISSN
|
0891-2513 |
|
Factor de impacto JCR
|
0 |
|
Información de impacto
|
|
|
Volumen
|
18 |
|
DOI
|
|
|
Número de revista
|
3 |
|
Desde la página
|
345 |
|
Hasta la página
|
365 |
|
Mes
|
JULIO |
|
Ranking
|
|