Skip to main content
Springer Nature Link
Log in

Synthesis of Non-uniform Cellular Automata Having only Point Attractors

  • Conference paper
Cellular Automata (ACRI 2014)

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

Included in the following conference series:

  • 3148 Accesses

Abstract

This paper studies a special class of non-uniform cellular automata (CAs) that contain only single length cycle (point) attractors in their state space. These CAs always converge to some point attractors. A number of theorems and lemmas are reported in this paper to characterize this class of CAs. Reachability tree, a discrete tool for characterizing 1-d CA, has been utilized to develop theories for these types of CAs. We finally report an algorithm that synthesizes a non-uniform cellular automaton having only point attractors.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Bandini, S., Vanneschi, L., Wuensche, A., Shehata, A.B.: Cellular automata pattern recognition and rule evolution through a neuro-genetic approach. J. Cellular Automata 4(3), 171–181 (2009)

    MATH  Google Scholar 

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

  3. 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)

    MATH  MathSciNet  Google Scholar 

  4. Maji, P., Pal Chaudhuri, P.: Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction. Inf. Sci. 178(10), 2315–2336 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Naskar, N., Adak, S., Das, S.: Identification of non-uniform periodic boundary cellular automata having only point states. In: AUTOMATA 2013: 19th International Workshop on Cellular Automata and Discrete Complex Systems, pp. 67–75 (September 2013)

    Google Scholar 

  6. Raghavan, R.: Cellular automata in pattern recognition. Information Sciences 70(12), 145–177 (1993)

    Article  MathSciNet  Google Scholar 

  7. Wolfram, S.: Theory and Application of Cellular Automata. World Scientific (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, formerly Bengal Engineering and Science University, Shibpur, 711103, India

    Sumit Adak & Sukanta Das

  3. Indian Statistical Institute, Machine Intelligence Unit, 203 B. T. Road, 700108, Kolkata, India

    Pradipta Maji

Authors
  1. Nazma Naskar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sumit Adak
    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. Dept. of Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Krakow, Poland

    Jarosław Wąs

  2. Dept. of Electrical and Computer Engineering, Democritus University of Thrace, 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  3. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20126, Milan, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Naskar, N., Adak, S., Maji, P., Das, S. (2014). Synthesis of Non-uniform Cellular Automata Having only Point Attractors. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11520-7_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11519-1

  • Online ISBN: 978-3-319-11520-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics