DocumentCode
2713024
Title
New properties of 2D Cellular Automata found through Polynomial Cellular Neural Networks
Author
Pazienza, Giovanni E. ; Gomez-Ramirez, Eduardo
Author_Institution
Cellular Sensory Wave Comput. Lab., MTA - SZTAKI, Budapest, Hungary
fYear
2009
fDate
14-19 June 2009
Firstpage
2459
Lastpage
2466
Abstract
In this paper we show how polynomial cellular neural networks can be used to find new properties of two-dimensional binary cellular automata (CA). In particular, we define formally a complexity index for totalistic and semi-totalistic CA, and we discuss on the intrinsic complexity of universal CA finding a surprising result: universal rules are slightly more complex than linearly separable ones.
Keywords
cellular automata; cellular neural nets; complexity index; polynomial cellular neural networks; semitotalistic cellular automata; totalistic cellular automata; two-dimensional binary cellular automata; Automata; Bridges; Cellular neural networks; Cities and towns; Cloning; Computer networks; Network synthesis; Neural networks; Polynomials; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 2009. IJCNN 2009. International Joint Conference on
Conference_Location
Atlanta, GA
ISSN
1098-7576
Print_ISBN
978-1-4244-3548-7
Electronic_ISBN
1098-7576
Type
conf
DOI
10.1109/IJCNN.2009.5178977
Filename
5178977
Link To Document