%0 Conference Proceedings
%T Shrinking and Expanding Cellular Automata
%+ Karlsruhe Institute of Technology (KIT)
%A Modanese, Augusto
%A Worsch, Thomas
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Zurich, Switzerland
%Y Matthew Cook
%Y Turlough Neary
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9664
%P 159-169
%8 2016-06-15
%D 2016
%R 10.1007/978-3-319-39300-1_13
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01435026/document
%2 https://inria.hal.science/hal-01435026/file/395687_1_En_13_Chapter.pdf
%L hal-01435026
%U https://inria.hal.science/hal-01435026
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9664
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA