Shrinking and Expanding Cellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2016

Shrinking and Expanding Cellular Automata

Augusto Modanese
  • Function : Author
  • PersonId : 998305
Thomas Worsch
  • Function : Author
  • PersonId : 884121

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.
Fichier principal
Vignette du fichier
395687_1_En_13_Chapter.pdf (273.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01435026 , version 1 (13-01-2017)

Licence

Attribution

Identifiers

Cite

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⟩
136 View
93 Download

Altmetric

Share

Gmail Facebook X LinkedIn More