RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY
From MaRDI portal
Publication:3602300
DOI10.1142/S012918310801211XzbMath1172.68550OpenAlexW1983937864MaRDI QIDQ3602300
Publication date: 12 February 2009
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012918310801211x
Cellular automata (computational aspects) (68Q80) Random number generation in numerical analysis (65C10)
Related Items (3)
On the effect of memory in one-dimensional \(k=4\) automata on networks ⋮ PROPAGATION CHARACTERISTICS OF THE DIVERGENCE OF ELEMENTARY CELLULAR AUTOMATA ⋮ Cellular Automata with Random Memory and Its Implementations
Cites Work
- Unnamed Item
- Unnamed Item
- Random sequence generation by cellular automata
- Pseudo random coins show more heads than tails
- Reversible cellular automata with memory: two-dimensional patterns from a single site seed
- Three-state one-dimensional cellular automata with memory
- TWO-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS STARTING WITH A SINGLE SITE SEED
- EFFECT OF MEMORY ON BOOLEAN NETWORKS WITH DISORDERED DYNAMICS: THE K = 4 CASE
- ONE-DIMENSIONAL r=2 CELLULAR AUTOMATA WITH MEMORY
- INCREMENTAL EVOLUTION OF CELLULAR AUTOMATA FOR RANDOM NUMBER GENERATION
- CONFIGURABLE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION
- OPTIMIZATION OF 2D LATTICE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION
This page was built for publication: RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY