title: Lempel-Ziv complexity analysis of one dimensional cellular automata.
abstract: Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.
authors.affiliation: Facultad de Física-Instituto de Ciencias y Tecnología de Materiales (IMRE), University of Havana, San Lazaro y L, CP 10400 La Habana, Cuba.
authors.forename: E
authors.initials: E
authors.lastname: Estevez-Rams
authors.affiliation: Universidade Federal de Uberlandia, AV. Joao Naves de Avila, 2121-Campus Santa Monica, CEP 38408-144 Minas Gerais, Brazil.
authors.forename: R
authors.initials: R
authors.lastname: Lora-Serrano
authors.affiliation: Universidade Federal de Uberlandia, AV. Joao Naves de Avila, 2121-Campus Santa Monica, CEP 38408-144 Minas Gerais, Brazil.
authors.forename: C A J
authors.initials: CA
authors.lastname: Nunes
authors.affiliation: Universidad de las Ciencias Informáticas (UCI), Carretera a San Antonio, Boyeros, La Habana, Cuba.
authors.forename: B
authors.initials: B
authors.lastname: Aragón-Fernández