A sequential solution to the density classification task using an intermediate alphabet

DOI10.1007/978-3-032-01570-9_8MaRDI QIDQ6860455zbMATH OpenFDO

Authors Pacôme Perrotin, Pedro Paulo Balbi, Eurico L. P. Ruivo

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01570-9_8

zbMATH Keywords

cellular automatadensity classification tasksequential update

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cites work

• A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
• A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update
• Complexity of one-way cellular automata
• Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph
• Lattice-gas cellular automata and lattice Boltzmann models. An introduction
• MODELING INFECTIOUS DISEASES USING GLOBAL STOCHASTIC CELLULAR AUTOMATA
• Modified traffic cellular automaton for the density classification task
• Simulating complex systems by cellular automata.
• Solving the density classification problem with a large diffusion and small amplification cellular automaton
• Solving the parity problem in one-dimensional cellular automata
• Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
• Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

This page was built for publication: A sequential solution to the density classification task using an intermediate alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860455)