Modified traffic cellular automaton for the density classification task

MaRDI QIDQ2893307zbMATH OpenFDO

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

zbMATH Keywords

cellular automatadensity classificationtraffic CA

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

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)

• Two-dimensional traffic rules and the density classification problem
• Restricted density classification in one dimension
• Simply modified GKL density classifiers that reach consensus faster
• Density classification quality of the traffic-majority rules
• CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
• Self-stabilisation of Cellular Automata on Tilings
• Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph
• A survey of cellular automata: types, dynamics, non-uniformity and applications

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)