An analytical model of Cellular Automata (CA) that uses the meta- phor of natural language to explore the organizational complexity of CA systems is presented. Starting from the CA states as units of this lan- guage, we analyzed how such data form patterns of dierent complexity in the parameter space of all the possible combinations of these basic elements. From the simulations, linguistic structures that have precise rules of coupling and dierent levels of complexity emerged, allowing an endless generation of new linguistically acceptable patterns within the rules of that system. The analysis of these spatio-temporal patterns and of their related dynamics, carried out by the creation of regular domains and gliders interaction, allowed the possibility to test many hypothesis on language development (as many operations such as con- catenation, intersection, union, complementation and reverse of strings can be tested) and, accordingly, to understand further the nature of complexity.

Complex interactions in one-dimensional cellular automata and linguistic constructions

Bertacchini, Francesca;Bilotta, Eleonora;CALDAROLA, FABIO;Pantano, Pietro
2018

Abstract

An analytical model of Cellular Automata (CA) that uses the meta- phor of natural language to explore the organizational complexity of CA systems is presented. Starting from the CA states as units of this lan- guage, we analyzed how such data form patterns of dierent complexity in the parameter space of all the possible combinations of these basic elements. From the simulations, linguistic structures that have precise rules of coupling and dierent levels of complexity emerged, allowing an endless generation of new linguistically acceptable patterns within the rules of that system. The analysis of these spatio-temporal patterns and of their related dynamics, carried out by the creation of regular domains and gliders interaction, allowed the possibility to test many hypothesis on language development (as many operations such as con- catenation, intersection, union, complementation and reverse of strings can be tested) and, accordingly, to understand further the nature of complexity.
Cellular Automata
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11770/288758
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact