A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update

DOI10.1007/s11047-017-9650-1zbMath1528.68244OpenAlexW2765113332MaRDI QIDQ6084238

Pedro P. B. de Oliveira, Eric Goles Chacc, Marco Montalva-Medel

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9650-1

zbMATH Keywords

densitydecision problemclassification problememergent computationparitylanguage recognitionone-dimensional cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

Amoebae for clustering: a bio-inspired cellular automata method for data classification

Cites Work

• Solving the parity problem in one-dimensional cellular automata
• Theory of cellular automata: a survey
• Complexity classes on spatially periodic Cellular Automata
• ONE DIMENSIONAL nARY DENSITY CLASSIFICATION USING TWO CELLULAR AUTOMATON RULES
• Remarks on the Cellular Automaton Global Synchronisation Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update