A padding technique on cellular automata to transfer inclusions of complexity classes

Authors:
Victor Poupet
Affiliations:
LIP (UMR CNRS, ENS Lyon, INRIA, Univ. Claude Bernard Lyon 1), École Normale Supérieure de Lyon, LYON cedex, France
Venue:
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Year:
2007

Citing 9
Cited 0

On real-time cellular automata and trellis automata

Acta Informatica
Relating the power of cellular arrays to their closure properties

Theoretical Computer Science
Variations of the firing squad problem and applications

Information Processing Letters
Synchronization of a line of identical processors at a given time

Fundamenta Informaticae
Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
Simple Computation-Universal Cellular Spaces

Journal of the ACM (JACM)
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

IEEE Transactions on Computers
Real-time language recognition by one-dimensional cellular automata

Journal of Computer and System Sciences
Tape bounds for time-bounded turing machines

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.