A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes

Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes implies others). Then we will discuss the consequences of this result, in particular when considering that all languages recognized in linear space can be recognized in linear time (whether or not this is true is still an open question), and see the implications on one-tape Turing machines.

• Type: Conference
• Year: 2007
• Where: CSR
• Authors: Victor Poupet
• Keywords: Classes Implies Others, CSR 2007, Onedimensional Cellular Automata, Theoretical Computer Science, Transfer Theorem