Skip to main content

Characterization of Non-reachable States in Irreversible CA State Space

  • Conference paper
Cellular Automata (ACRI 2008)

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

Included in the following conference series:

Abstract

This paper targets characterization of the non-reachable states of 1-dimensional irreversible cellular automata (CA). A theoretical framework has been developed to design algorithms for computing the number of non-reachable states as well as the number of single cycle attractors of such a CA.

This research work is supported by the Sponsored CA Research Projects, Bengal Engineering and Science University, Shibpur, West Bengal, India-711103.

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

Access this chapter

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. Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata - Theory and Applications, vol. 1. IEEE Computer Society Press, California (1997)

    MATH  Google Scholar 

  2. Das, S., Sikdar, B.K.: Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In: Proceedings of International Conference on Cellular Automata for Research and Industry, ACRI, France, pp. 68–77 (September 2006)

    Google Scholar 

  3. Das, S., Sikdar, B.K., Chaudhuri, P.P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Proceedings of Sixth International Conference on Cellular Automata for Research and Industry, ACRI, The Netherlands, pp. 813–822 (October 2004)

    Google Scholar 

  4. Moore, E.F.: Machine models of self reproduction. In: Burks, A.W. (ed.) Essays on Cellular Automata, University of Illinois Press, Urbana (1970)

    Google Scholar 

  5. Myhill, J.: The converse of moore’s garden of eden theorem. In: Proceedings of American Mathematical Society, vol. 14, pp. 685–686 (1963)

    Google Scholar 

  6. von Neumann, J.: The theory of self-reproducing Automata. In: Burks, A.W. (ed.), Univ. of Illinois Press, Urbana (1966)

    Google Scholar 

  7. Wolfram, S.: Cellular Automata and Complexity - Collected Papers. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hiroshi Umeo Shin Morishita Katsuhiro Nishinari Toshihiko Komatsuzaki Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, S., Sikdar, B.K. (2008). Characterization of Non-reachable States in Irreversible CA State Space. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79992-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79991-7

  • Online ISBN: 978-3-540-79992-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics