Skip to main content
SpringerLink
Log in

Scalability of Non-uniform Cellular Automata Having only Point State Attractors

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

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

Included in the following conference series:

Abstract

In this paper, the concept of scalable non-uniform cellular automata (CAs) is discussed. The scalability of CA refers to its ability to accommodate more number of cells keeping the CA’s dynamic behaviour unchanged. That is, a CA with n cell, converges to point state attractor from any seed also converges to point state attractor when another few cells are added. Using scalability of CA, a CA based scalable pattern classifier is introduced.

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 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

Institutional subscriptions

Notes

  1. 1.

    A rule \(\mathcal {R}\) is said to be right independent rule, if each sibling pairs of RMTs r, s have same next state value either 0 or 1 that is \(\mathcal {R}[r]\) = \(\mathcal {R}[s]\).

References

  1. Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chatterjee, S.: Additive Cellular Automata – Theory and Applications. IEEE Computer Society Press, New York (1997). ISBN 0-8186-7717-1

    Google Scholar 

  2. Das, S.: Theory and applications of nonlinear cellular automata In VLSI design. Ph.D. 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  MATH  Google Scholar 

  4. 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 

  5. Gallant, S.I.: Neural Networks Learning and Expert Systems. Mass, MIT Press, Cambridge (1993)

    MATH  Google Scholar 

  6. Nazma, M., Naskar, B.J.: Characterization and synthesis of non-uniform cellular automata with point state attractors. Ph.D. thesis. IIEST, Shibpur (2016)

    Google Scholar 

  7. Naskar, N., Adak, S., Maji, P., Das, S.: Synthesis of non-uniform cellular automata having only point attractors. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 105–114. Springer, Heidelberg (2014)

    Google Scholar 

  8. Naskar, N., Chakraborty, A., Maji, P., Das, S.: Analysis of reachability tree for identification of cyclic and acyclic CA states. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 63–72. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Naskar, N., Das, S., Sikdar, B.K.: Characterization of nonlinear cellular automata having only single length cycle attractors. Journal of Cellular Automata 7(5–6), 431–453 (2012)

    MathSciNet  MATH  Google Scholar 

  10. Von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Champaign (1966)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Nazma Naskar

  2. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, 711103, India

    Sukanta Das

Authors
  1. Nazma Naskar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nazma Naskar .

Editor information

Editors and Affiliations

  1. University of Perpignan, Perpignan, France

    Samira El Yacoubi

  2. AGH University of Science and Techn, Kraków, Poland

    Jaroslaw Wąs

  3. Department of Computer Science, University of Milano-Bicocca, Milan, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Naskar, N., Das, S. (2016). Scalability of Non-uniform Cellular Automata Having only Point State Attractors. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44365-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44364-5

  • Online ISBN: 978-3-319-44365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation