2017 |
Volume 5 |
Issue Issue 2
A Survey on Cellular Automata with the Application in Pseudo Random Number Generation
1.
I. Gethzi Ahila Poornima
– Dept. of Comp. Science and Engg., National Engg. College, Anna Univer., Tamil Nadu, India.
2.
B. Paramasivan
– Dept. of Comp. Science and Engg., National Engg. College, Anna Univer., Tamil Nadu, India.
3.
K. Mohaideen Pitchai
– Dept. of Comp. Science and Engg., National Engg. College, Anna Univer., Tamil Nadu, India.
4.
M. Bhuvaeswari
– Dept. of Comp. Science and Engg., National Engg. College, Anna Univer., Tamil Nadu, India.
Received
-
|
Accepted
-
|
Published
19-Feb-2018
|
Abstract
The Cellular Automata (CA) were invented in the late 1940 by Stanislaw Ulam and John Von Neumann. CA are simple models of computation in which the components act together and exhibit complex behavior. Initially CA are represented as model of self-reproducing organisms. Later they are applied in various areas like Physics, biology and other applications. The self-reproducing behavior is then utilized to construct Universal Turing Machine. This Survey is about the applications of CA closer to Computer Science especially designing Pseudo Random Number Generator.
Keywords Cellular Automata, CA, Applications of CA , Pseudo random number generator, PRNG, 1D CA rules.
Locked
Subscribed
Open Access
