Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Cellular Automata and Discrete Complex Systems

AUTOMATA 2014: Cellular Automata and Discrete Complex Systems pp 106–120Cite as

Language Recognition by Reversible Partitioned Cellular Automata

  • Conference paper
  • First Online:

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

Abstract

We investigate the language accepting capability of one-dimensional reversible partitioned cellular automata (RPCAs). It is well known that bounded cellular automata (CAs) are equivalent to deterministic linear-bounded automata (DLBAs) in their language accepting capability. Here, we prove RPCAs are also equivalent to them by showing a construction method of an RPCA that simulates a given DLBA. Thus, the reversibility constraint does not decrease the ability of PCAs.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Kutrib, M.: Cellular automata and language theory. In: Meyers, B. (ed.) Encyclopedia of Complexity and System Science, pp. 800–823. Springer-Verlag, Berlin (2009)

    Chapter  Google Scholar 

  2. Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inform. Comput. 206, 1142–1151 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60, 354–367 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Morita, K.: Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. Theoret. Comput. Sci. 412, 3856–3865 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Morita, K.: Two-way reversible multi-head finite automata. Fundamenta Informaticae 110(1–4), 241–254 (2011)

    MathSciNet  MATH  Google Scholar 

  6. Morita, K.: A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads. In: Glück, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 29–43. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Jpn. E72, 758–762 (1989)

    Google Scholar 

  8. Smith III, A.: Real-time language recognition by one-dimensional cellular automata. J. Comput. Syst. Sci. 6, 233–253 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

This work was supported by JSPS KAKENHI Grant Number 24500017.

Author information

Authors and Affiliations

  1. Hiroshima University, Higashi-Hiroshima, 739–8527, Japan

    Kenichi Morita

Authors
  1. Kenichi Morita
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kenichi Morita .

Editor information

Editors and Affiliations

  1. University of Hyogo, Himeji, Japan

    Teijiro Isokawa

  2. Hiroshima University, Hiroshima, Japan

    Katsunobu Imai

  3. University of Hyogo, Himeji, Japan

    Nobuyuki Matsui

  4. National Institute of Information and Communications Technology, Osaka, Japan

    Ferdinand Peper

  5. Osaka Electro-Communication University, Osaka, Japan

    Hiroshi Umeo

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Morita, K. (2015). Language Recognition by Reversible Partitioned Cellular Automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Lecture Notes in Computer Science(), vol 8996. Springer, Cham. https://doi.org/10.1007/978-3-319-18812-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18812-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18811-9

  • Online ISBN: 978-3-319-18812-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation