Skip to main content
SpringerLink
Log in

Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2022)

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

  • 498 Accesses

Abstract

This work reports characterization of 1-dimensional periodic boundary cellular automata (PBCA) rules in 3-neighborhood for identification of CA rules that influence the formation of single length cycle attractors (fixed points). It targets the synthesis of CA with only one fixed point (SACA) for arbitrary length. The graph based tool NSRT diagram (NSRTD) provides the theoretical framework for this characterization. Schemes are developed to identify the SACA rules that form uniform SACA for all length.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Dennunzio, A., Formenti, E., Grinberg, D., Margara, L.: An efficiently computable characterization of stability and instability for linear cellular automata. J. Comput. Syst. Sci. 122, 63–71 (2021)

    Article  MathSciNet  Google Scholar 

  2. Dennunzio, A., Formenti, E., Provillard, J.: Local rule distributions, language complexity and non-uniform cellular automata. Theoret. Comput. Sci. 504, 38–51 (2013)

    Article  MathSciNet  Google Scholar 

  3. Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chatterjee, S.: Additive Cellular Automata - Theory and Applications, vol. 1. IEEE Computer Society Press, California, USA (1997)

    Google Scholar 

  4. Chopard, B.: Cellular automata and lattice Boltzmann modeling of physical systems. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds.) Handbook of Natural Computing. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-540-92910-9_9

    Chapter  Google Scholar 

  5. Dalui, M.: Theory and applications of cellular automata for CMPs cache system protocol design and verification, Ph.D. thesis, Indian Institute of Engineering Science and Technology (2014)

    Google Scholar 

  6. Das, B.: Design and evaluation of data migration policies for shared cache on chip multiprocessors, Ph.D. thesis, Indian Institute of Engineering Science and Technology (2017)

    Google Scholar 

  7. Das, B., Maiti, N.S., Das, S., Sikdar, B.K.: An efficient scheme for data block migration in tiled CMPs cache system. In: IEEE India INDICON, 13–15 December 2013, pp. 1–6 (2013)

    Google Scholar 

  8. Das, S., Mukherjee, S., Naskar, N., Sikdar, B.K.: Characterization of single cycle CA and its application in pattern classification. In: 15th International Workshop on Cellular Automata and Discrete Complex Systems, vol. 252, no. 1, pp. 181–203 (2009)

    Google Scholar 

  9. Das, S., Sikdar, B.K.: Characterization of 1-d periodic boundary reversible CA. Electron. Notes Theoret. Comput. Sci. 252, 205–227 (2009)

    Google Scholar 

  10. Dennunzio, A., Formenti, E., Grinberg, D., Margara, L.: Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption. Inf. Sci. 563, 183–195 (2021)

    Article  MathSciNet  Google Scholar 

  11. Ganguly, Niloy, Das, Arijit, Maji, Pradipta, Sikdar, Biplab K.., Pal Chaudhuri, P..: Evolving cellular automata based associative memory for pattern recognition. In: Monien, Burkhard, Prasanna, Viktor K.., Vajapeyam, Sriram (eds.) HiPC 2001. LNCS, vol. 2228, pp. 115–124. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45307-5_11

    Chapter  Google Scholar 

  12. Dalui, M., Chakraborty, B., Das, N., Sikdar, B.K.: NSRT diagram for identification of SACA and TACA rules in null-boundary. Int. J. Mod. Phys. C 33(6), 2250071 (2022)

    Google Scholar 

  13. Kamilya, S., Adak, S., Das, S., Sikdar, B.K.: SACAs: (non-uniform) cellular automata that converge to a single fixed point. J. Cell. Automata 14(1–2), 27–49 (2019)

    MathSciNet  MATH  Google Scholar 

  14. Sutner, K.: De Bruijin graphs and linear cellular automata. Complex Syst. 5(1), 19–30 (1991)

    MathSciNet  MATH  Google Scholar 

  15. Wolfram, S.: Universality and complexity in cellular automata. Physica D 10(1–2), 1–35 (1984)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering Management, Kolkata, WB, India

    Baisakhi Das

  2. National Institute of Technology, Durgapur, 713209, WB, India

    Mousumi Saha

  3. Indian Institute of Engineering Science and Technology, Howrah, 711103, WB, India

    Nilanjana Das & Biplab K Sikdar

Authors
  1. Baisakhi Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mousumi Saha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nilanjana Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Biplab K Sikdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Biplab K Sikdar .

Editor information

Editors and Affiliations

  1. University of Geneva, Geneva, Switzerland

    Bastien Chopard

  2. University of Milano-Bicocca, Milan, Italy

    Stefania Bandini

  3. University of Milano-Bicocca, Milan, Italy

    Alberto Dennunzio

  4. University of Geneva, Geneva, Switzerland

    Mira Arabi Haddad

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Das, B., Saha, M., Das, N., Sikdar, B.K. (2022). Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram. In: Chopard, B., Bandini, S., Dennunzio, A., Arabi Haddad, M. (eds) Cellular Automata. ACRI 2022. Lecture Notes in Computer Science, vol 13402. Springer, Cham. https://doi.org/10.1007/978-3-031-14926-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-14926-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-14925-2

  • Online ISBN: 978-3-031-14926-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation