On Randomness and the Genetic Behavior of Cellular Automata

Author

Toutounji, Hazem ; Aljundi, A. Chadi

Author_Institution

Dept. of Comput. Eng., Univ. of Aleppo, Aleppo

fYear

2008

Firstpage

1

Lastpage

6

Abstract

We investigate a new approach in utilizing a given classification to cellular automata to search for a particular behavior cellular automaton with a genetic algorithm. This investigation leads to the formation of two new concepts. The first is creating a new method to measure randomness in finite binary sequences depending on iterations in patterns. The second is the sculpturing of the term chromosomity. As defined in this paper, a property is said to be chromosomic (i.e. has chromosomity or shows a genetic behavior) if it can be searched for with a genetic algorithm.

Keywords

binary sequences; cellular automata; genetic algorithms; random sequences; cellular automata; chromosomity; genetic algorithm; genetic behavior; randomness; Automata; Binary sequences; Biological cells; Biological system modeling; Biology computing; Concurrent computing; Cryptography; Genetic algorithms; Genetic engineering; Stability; cellular automata; chromosomity; classification; finite binary sequence; fitness; fuzzy; patternless; randomness;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on

Conference_Location

Damascus

Print_ISBN

978-1-4244-1751-3

Electronic_ISBN

978-1-4244-1752-0

Type

conf

DOI

10.1109/ICTTA.2008.4530320

Filename

4530320