Abstract
We will show how padding techniques can be applied on one-dimensional 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Poupet, V. (2007). A padding technique on cellular automata to transfer inclusions of complexity classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4649 LNCS, pp. 337–348). Springer Verlag. https://doi.org/10.1007/978-3-540-74510-5_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
