Skip to main content
SpringerLink
Log in

Characterization of Reachable/Nonreachable Cellular Automata States

  • Conference paper
Cellular Automata (ACRI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3305))

Included in the following conference series:

Abstract

This paper reports characterization of reachable/nonreachable states of 3-neighborhood non-homogeneous Cellular Automata (CA). An efficient scheme to identify nonreachable states in O(n) time is proposed. It also computes the number of such states in O(n) time. The reported characterization of nonreachable states provides the theoretical background to identify and synthesize a reversible CA in linear time.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Neumann, J.V.: The Theory of Self Reproducing Automata. In: Burks, A.W. (ed.). University of Illinois Press, Urbana (1966)

    Google Scholar 

  2. Wolfram, S.: Theory and application of cellular automata. World Scientific, Singapore (1986)

    Google Scholar 

  3. Pal Chaudhuri, P., Roy Choudhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications. IEEE Computer Society Press, USA

    Google Scholar 

  4. Das, S., Kundu, A., Sen, S., Sikdar, B.K., Chaudhuri, P.P.: Non-Linear Cellular Automata Based PRPG Design (Without Prohibited Pattern Set) In Linear Time Complexity. In: Asian Test Conference (2003)

    Google Scholar 

  5. Wolfram, S., Martin, O., Odlyzko, A.M.: Algebraic Properties of Cellular Automata. Communications in Mathematical Physics 93, 219–258 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Wuensche, A.: Attractor Basins of Discrete Networks. Cognitive Science Research Paper, The University of Sussex (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Bengal Engineering College (D U), Howrah, India, 711103

    Sukanta Das

  2. Department of Computer Science & Technology, Bengal Engineering College (D U), Howrah, 711103, India

    Biplab K. Sikdar

  3.  , Flat E4, Block H30, Murchhana Housing, Kolkata, 94, India

    P. Pal Chaudhuri

Authors
  1. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Biplab K. Sikdar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Pal Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, S., Sikdar, B.K., Chaudhuri, P.P. (2004). Characterization of Reachable/Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation