Skip to main content
SpringerLink
Log in

Analysis of Reachability Tree for Identification of Cyclic and Acyclic CA States

  • Conference paper
Cellular Automata (ACRI 2012)

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

Included in the following conference series:

Abstract

This paper reports a scheme to identify cyclic/acyclic states from the state space of cellular automata (CA). We analyze the reachability tree to do this. An algorithm is presented to count the cyclic states. We introduce a concept of tree merging for identifying cyclic and acyclic states. To our knowledge, this is the first work to efficiently identify cyclic/acyclic states from the state space of nonlinear CA. Since cyclic states can only form attractors, the identification of cyclic states would help us to characterize CA attractors.

This work is supported by AICTE Career Award fund (F.No. 1-51/RID/CA/29/ 2009-10), awarded to Sukanta Das.

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

    Google Scholar 

  2. Das, S.: Theory and Applications of Nonlinear Cellular Automat. In: VLSI Design. PhD thesis, Bengal Engineering and Science University, Shibpur, India (2007)

    Google Scholar 

  3. Das, S., Mukherjee, S., Naskar, N., Sikdar, B.K.: Characterization of single cycle ca and its application in pattern classification. Electr. Notes Theor. Comput. Sci. 252, 181–203 (2009)

    Article  MathSciNet  Google Scholar 

  4. Das, S., Sikdar, B.K.: Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 68–77. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Das, S., Shaw, C., Sikdar, B.K.: Exploring CA State Space to Synthesize Cellular Automata with Specified Attractor Set. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 152–159. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Das, S., Sikdar, B.K., Pal Chaudhuri, P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 813–822. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Maji, P., Shaw, C., Ganguly, N., Sikdar, B.K., Pal Chaudhuri, P.: Theory and Application of Cellular Automata For Pattern Classification. Special issue of Fundamenta Informaticae on Cellular Automata 58, 321–354 (2003)

    MathSciNet  MATH  Google Scholar 

  8. Maji, P.: Cellular Automata Evolution for Pattern Recognition. PhD thesis, Jadavpur University, Kolkata, India (2005)

    Google Scholar 

  9. Wolfram, S.: Theory and Application of Cellular Automata. World Scientific (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Technology, Seacom Engineering College, Howrah, 711302, India

    Nazma Naskar

  2. Dept. of Information Technology, Bengal Engg and Sci University, Shibpur, 711103, India

    Avik Chakraborty & Sukanta Das

  3. Machine Intelligence Unit, Indian Statistical Institute, Kolkata, 700108, India

    Pradipta Maji

Authors
  1. Nazma Naskar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avik Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pradipta Maji
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Naskar, N., Chakraborty, A., Maji, P., Das, S. (2012). Analysis of Reachability Tree for Identification of Cyclic and Acyclic CA States. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation