Skip to Main content Skip to Navigation
Conference papers

Shrinking and Expanding Cellular Automata

Abstract : Inspired by shrinking cellular automata (SCA), we investigate another variant of the classical one-dimensional cellular automaton: the shrinking and expanding cellular automaton (SXCA). In addition to the capability to delete some cells as in SCA, an SXCA can also create new cells between already existing ones. It is shown that there are reasonably close (polynomial) relations between the time complexity of SXCA and the space and time complexity of Turing machines and alternating Turing machines respectively. As a consequence the class of problems decidable in polynomial time by SXCA coincides with PSPACE.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, January 13, 2017 - 3:23:49 PM
Last modification on : Friday, January 13, 2017 - 3:29:41 PM
Long-term archiving on: : Friday, April 14, 2017 - 7:28:45 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Augusto Modanese, Thomas Worsch. Shrinking and Expanding Cellular Automata. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. pp.159-169, ⟨10.1007/978-3-319-39300-1_13⟩. ⟨hal-01435026⟩



Record views


Files downloads