RANDOMIZED CELLULAR AUTOMATA
From MaRDI portal
Publication:3500246
Abstract: We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.
Recommendations
Cites work
Cited in
(16)- Diploid cellular automata: first experiments on the random mixtures of two elementary rules
- Random number generation using decimal cellular automata
- Direct counting analysis on network generated by discrete dynamics
- One-dimensional stochastic cellular automata
- Propagation, diffusion and randomization in cellular automata
- scientific article; zbMATH DE number 4180823 (Why is no real title available?)
- Generalized Automata Networks
- Outer median and probabilistic cellular automata on network topologies
- Planar trinet dynamics with two rewrite rules
- Random walks in cellular automata
- Stochastic cellular automata
- scientific article; zbMATH DE number 797391 (Why is no real title available?)
- Randomized Computation with Cellular Automata
- Four State Deterministic Cellular Automaton Rule Emulating Random Diffusion
- A pseudo-random network mobile automaton with linear growth
- A new class of automata networks
This page was built for publication: RANDOMIZED CELLULAR AUTOMATA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500246)