Deterministic Computing Techniques for Perfect Density Classification

DOI10.1142/S0218127419500640zbMath1419.68065OpenAlexW2964346277WikidataQ127752966 ScholiaQ127752966MaRDI QIDQ5379863

Suryakanta Pal, Sudhakar Sahoo, Birendra Kumar Nayak

Publication date: 14 June 2019

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127419500640

zbMATH Keywords

Turing machinedensity classificationcellular automata rulesstate-transition diagramsnumber-conserving cellular automata rules

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conceptual Connections around Density Determination in Cellular Automata
• An Analytical Formulation for Cellular Automata (CA) Based Solution of Density Classification Task (DCT)
• Two-dimensional cellular automata of radius one for density classification task
• Probabilistic cellular automata with conserved quantities
• ONE DIMENSIONAL nARY DENSITY CLASSIFICATION USING TWO CELLULAR AUTOMATON RULES
• The Density Classification Problem in the Context of Continuous Cellular Automata
• Density-conserving affine continuous cellular automata solving the relaxed density classification problem

This page was built for publication: Deterministic Computing Techniques for Perfect Density Classification