Skip to main content
SpringerLink
Log in

Analysis of Hybrid Group Cellular Automata

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

Abstract

In this paper, we analyze a Linear Hybrid Group Cellular Automata(LHGCA) C and the complemented group CA derived from C with rules 60, 102 and 204. And we give the conditions for the complement vectors which determine the state transition of the CA dividing the entire state space into smaller spaces of equal maximum cycle lengths. And we show the relationship between cycles of complemented group CA. Our results extend and generalize Mukhopadhyay’s results.

This work was supported by grant No. (R01-2006-000-10260-0) from the Basic Research Program of the Korea Science and Engineering Foundation.

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. Von Neumann, J.: The theory of self-reproducing automata. In: Burks, A.W. (ed.), Univ. of Illinois Press, Urbana and London (1966)

    Google Scholar 

  2. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601–644 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Thatcher, J.: Universality in Von Neumann cellular model, Tech. Rep. 03105-30-T, ORA, University of Michigan (1964)

    Google Scholar 

  4. Lee, C.: Synthesis of a cellular universal machine using 29-state model of Von Neumann. In: The University of Michigan Engineering Summer Conferences (1964)

    Google Scholar 

  5. Hennie, F.C.: Iterative arrays of logical circuits. Academic, New York (1961)

    Google Scholar 

  6. Das, A.K., Chaudhuri, P.P.: Efficient characterization of cellular automata. Proc. IEE (Part E) 137, 81–87 (1964)

    Google Scholar 

  7. Das, A.K., Chaudhuri, P.P.: Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation. IEEE Trans. Comput. 42, 340–352 (1993)

    Article  MathSciNet  Google Scholar 

  8. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography. IEEE Trans. Computers 43, 1346–1357 (1994)

    Article  Google Scholar 

  9. Mukhopadhyay, D., Chowdhury, D.R.: Characterization of a class of complemented group cellular automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 775–784. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Chakraborty, S., Chowdhury, D.R., Chaudhuri, P.P.: Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines. IEEE Trans. Computers 45, 769–781 (1996)

    Article  MATH  Google Scholar 

  11. Nandi, S., Chaudhuri, P.P.: Analysis of periodic and intermediate boundary 90/150 cellular automata. IEEE Trans. Computers 45(1), 1–12 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Cho, S.J., Choi, U.S., Hwang, Y.H., Pyo, Y.S., Kim, H.D., Kim, K.S., Heo, S.H.: Computing phase shifts of maximum-length 90/150 cellular automata sequences. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 31–39. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Cho, S.J., Choi, U.S., Kim, H.D.: Analysis of complemented CA derived from a linear TPMACA. Computers and Mathematics with Applications 45, 689–698 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cho, S.J., Choi, U.S., Kim, H.D.: Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. Mathematical and Computer Modelling 36, 979–986 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cho, S.J., Hwang, Y.H., Choi, U.S., Kim, H.D., Pyo, Y.S.: Characterization of a class of the complemented CA derived from linear uniform CA (submitted)

    Google Scholar 

  16. Sen, S., Shaw, C., Chowdhury, D.R., Ganguly, N., Chaudhuri, P.P.: Cellular automata based cryptosystem. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 303–314. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Mukherjee, M., Ganguly, N., Chaudhuri, P.P.: Cellular automata based authentication. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 259–269. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Elspas, B.: The theory of autonomous linear sequential networks. TRE Trans. on Circuits CT-6(1), 45–60 (1959)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematical Sciences, Pukyong National University, Busan, 608-737, Korea

    Sung-Jin Cho

  2. Department of Multimedia Engineering, Tongmyong University, Busan, 626-847, Korea

    Un-Sook Choi

  3. Department of Information Security, Graduate School, Pukyong National University, Busan, 608-737, Korea

    Yoon-Hee Hwang

  4. Institute of Mathematical Sciences and School of Computer Aided Science, Inje University, Gimhae, 621-749, Korea

    Han-Doo Kim

Authors
  1. Sung-Jin Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Un-Sook Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoon-Hee Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Han-Doo Kim
    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

Cho, SJ., Choi, US., Hwang, YH., Kim, HD. (2006). Analysis of Hybrid Group Cellular Automata. 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_27

Download citation

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

  • 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