Modified traffic cellular automaton for the density classification task
From MaRDI portal
Publication:2893307
zbMATH Open1241.68083MaRDI QIDQ2893307FDOQ2893307
Authors: Jarkko Kari, Bastien Le Gloannec
Publication date: 20 June 2012
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: http://iospress.metapress.com/content/m239581t35g6m51t/fulltext.html
Recommendations
- Density classification quality of the traffic-majority rules
- 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
- Computational mechanisms for solving the density classification task by cellular automata
Cited In (8)
- Simply modified GKL density classifiers that reach consensus faster
- Two-dimensional traffic rules and the density classification problem
- Self-stabilisation of Cellular Automata on Tilings
- Density classification quality of the traffic-majority rules
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
- Restricted density classification in one dimension
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph
This page was built for publication: Modified traffic cellular automaton for the density classification task
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893307)