Density classification on infinite lattices and trees
From MaRDI portal
(Redirected from Publication:388922)
Recommendations
- Density classification on infinite lattices and trees
- Restricted density classification in one dimension
- Solving two-dimensional density classification problem with two probabilistic cellular automata
- Two-dimensional traffic rules and the density classification problem
- Solving the density classification problem with a large diffusion and small amplification cellular automaton
Cited in
(14)- Two-dimensional traffic rules and the density classification problem
- Phase diagrams of majority voter probabilistic cellular automata
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
- Density-conserving affine continuous cellular automata solving the relaxed density classification problem
- Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
- Restricted density classification in one dimension
- The density classification problem in the context of continuous cellular automata
- Amoebae for clustering: a bio-inspired cellular automata method for data classification
- Simply modified GKL density classifiers that reach consensus faster
- Self-stabilisation of Cellular Automata on Tilings
- Overview: PCA models and issues
- Density classification on infinite lattices and trees
- Affine continuous cellular automata solving the fixed-length density classification problem
- Around probabilistic cellular automata
This page was built for publication: Density classification on infinite lattices and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388922)
