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

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