Skip to main content
SpringerLink
Log in

Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition

  • Conference paper
Cellular Automata (ACRI 2006)

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

Included in the following conference series:

  • 2230 Accesses

Abstract

Das et al. have reported characterization of reachable/non-reachable CA states recently. Their scheme has only offered the characterization under a null boundary CA (NBCA). However, in hardware implementation, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register structure because of its circular property. Thus, this paper provides two decision algorithms for classification of reachable/non-reachable state and group/non-group CA based on periodic boundary condition.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Neumann, J.V.: The Theory of Self Reproducing Automata. In: Burks, A.W. (ed.), Univ. of Illinois Press, Urbana and London (1996)

    Google Scholar 

  2. Wolfram, S.: Statistical Mechanics of Cellular Automata. Rev. Mod. Phys. 55, 601–644 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Martin, O., Odlyzko, A.M., Wolfram, S.: Algebraic properties of cellular automata. Commun. Math. Phys. 93, 219–258 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI application. IEEE Trans. Comput. 12, 1013–1024 (1986)

    Article  Google Scholar 

  5. Chaudhuri, P.P., Choudhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications. IEEE Computer Society Press, USA (1997)

    MATH  Google Scholar 

  6. Wuensche, A.: Attractor Basins of Discrete Networks. Cognitive Science Research Paper, The University of Sussex (1997)

    Google Scholar 

  7. Das, S., Sikdar, B.K., Chaudhuri, P.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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Kyungpook National University, Daegu, 702-701, Korea

    Byung-Heon Kang, Jun-Cheol Jeon & Kee-Young Yoo

Authors
  1. Byung-Heon Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-Cheol Jeon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kee-Young Yoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Mathematics, Physics and Systems, University of Perpignan, 52, Paul Alduy Avenue, 66860, Perpignan, Cedex, France

    Samira El Yacoubi

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Research Center on Complex Systems and Artificial Intelligence (CSAI) Department of Computer Science, Systems and Communication (DISCo), University of Milan, Bicocca viale Sarca, 336, 20126, Milan, (Italy)

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, BH., Jeon, JC., Yoo, KY. (2006). Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_15

Download citation

  • DOI: https://doi.org/10.1007/11861201_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40929-8

  • Online ISBN: 978-3-540-40932-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation