Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces

Authors:
Gina M. B. Oliveira;Luiz G. A. Martins;Laura B. de Carvalho;Enrique Fynn
Affiliations:
Artificial Intelligence Laboratory, Universidade Federal de Uberlândia, Uberlândia, Brazil;Artificial Intelligence Laboratory, Universidade Federal de Uberlândia, Uberlândia, Brazil;Artificial Intelligence Laboratory, Universidade Federal de Uberlândia, Uberlândia, Brazil;Artificial Intelligence Laboratory, Universidade Federal de Uberlândia, Uberlândia, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 6
Cited 2

Evolving two-dimensional cellular automata to perform density classification: a report on work in progress

Parallel Computing - Special issue on cellular automata: from modeling to applications
Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

Artificial Life
Evolving Globally Synchronized Cellular Automata

Proceedings of the 6th International Conference on Genetic Algorithms
Searching for a Cryptographic Model Based on the Pre-Image Calculus of Cellular Automata

SBRN '08 Proceedings of the 2008 10th Brazilian Symposium on Neural Networks
Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Using dynamic behavior prediction to guide an evolutionary search for designing two-dimensional cellular automata

ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life

Adaptive strategies applied to evolutionary search for 2D DCT cellular automata rules

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Dynamics of networks evolved for cellular automata computation

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of computational aspects of cellular automata (CA) is a recurrent theme being that the investigation of specific tasks to be solved by CA rules a common and widely-known approach. We investigated two of the most-studied computational tasks: synchronization (ST) and density classification (DCT). Different specifications of CA rule space were analyzed for both tasks: one-dimensional rules with radius 1 and 2, and two-dimensional rules with von Neumann and Moore neighborhoods. We also analyzed different lattice sizes when trying to execute these tasks. Several evolutionary experiments were performed to characterize ST and DCT on these different scenarios. Some interesting results have been occurred from these experiments as the adequacy of the tasks to be solved in two-dimensional spaces instead of 1D even using rules with the same length and the dependency to the parity of the lattice size related to good rules for DCT in 1D and 2D spaces.