Complexity classes on spatially periodic Cellular Automata - GREYC amacc Access content directly
Conference Papers Year : 2014

Complexity classes on spatially periodic Cellular Automata

Nicolas Bacquey

Abstract

This article deals with cellular automata (CA) working over periodic configurations, as opposed to standard CA, where the initial configuration is bounded by persistent symbols. We study the capabilities of language recognition and computation of functions over such automata, as well as the complexity classes they define over languages and functions. We show that these new complexity classes coincide with the standard ones starting from polynomial time. As a by-product, we present a CA that solves a somehow relaxed version of the density classification problem.
No file

Dates and versions

hal-00957130 , version 1 (08-03-2014)

Identifiers

Cite

Nicolas Bacquey. Complexity classes on spatially periodic Cellular Automata. STACS 2014, Mar 2014, Lyon, France. pp.1-12, ⟨10.4230/LIPIcs.STACS.2014.112⟩. ⟨hal-00957130⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More