Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computer Science – Theory and Applications (CSR 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4649))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Choffrut, C., Čulik II, K.: On real-time cellular automata and trellis automata. Acta Informatica 21, 393–407 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers 18, 349–365 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  3. Čulik II, K., Gruska, J., Salomaa, A.: Systolic automata for VLSI on balanced trees. Acta Inf. 18, 335–344 (1982)

    Google Scholar 

  4. Čulik II, K.: Variations of the firing squad problem and applications. Inf. Process. Lett. 30, 153–157 (1989)

    MATH  Google Scholar 

  5. Fischer, P.C.: Generation of primes by one-dimensional real-time iterative array. Journal of the Assoc. Comput. Mach. 12, 388–394 (1965)

    MATH  Google Scholar 

  6. Ibarra, O., Jiang, I.: Relating the power of cellular arrays to their closure properties. Theoretical Computer Science 57, 225–238 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. La Torre, S., Napoli, M., Parente, D.: Synchronization of a line of identical processors at a given time. Fundamenta Informaticae 34, 103–128 (1998)

    MATH  MathSciNet  Google Scholar 

  8. Paterson, M.S.: Tape bounds for time bounded Turing machines. JCSS 6, 116–124 (1972)

    MATH  MathSciNet  Google Scholar 

  9. Smith III, A.R.: Simple computation-universal cellular spaces. J. ACM 18, 339–353 (1971)

    Article  MATH  Google Scholar 

  10. Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. Journal of the Assoc. Comput. Mach. 6, 233–253 (1972)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP (UMR CNRS, ENS Lyon, INRIA, Univ. Claude Bernard Lyon 1), École Normale Supérieure de Lyon, 46 allée d’Italie 69364 LYON cedex 07, France

    Victor Poupet

Authors
  1. Victor Poupet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Diekert Mikhail V. Volkov Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poupet, V. (2007). A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74510-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74509-9

  • Online ISBN: 978-3-540-74510-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation