Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cellular Automata

ACRI 2016: Cellular Automata pp 3–13Cite as

Pseudorandom Pattern Generation Using 3-State Cellular Automata

  • Conference paper
  • First Online:

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

Abstract

This paper investigates the potentiality of pseudo-random pattern generation of 1-dimensional 3-state cellular automata (CAs). Here, a pattern represents configuration of a CA of length n. We have identified 805 CAs which have great potentiality to act as pseudorandom pattern generator (PRPG).

This research is partially supported by Innovation in Science Pursuit for Inspired Research (INSPIRE) under Dept. of Science and Technology, Govt. of India.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Bhattacharjee, K., Das, S.: Reversibility of \(d\)-state finite cellular automata. J. Cell. Automata 11(2–3), 213–245 (2016)

    MathSciNet  Google Scholar 

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

  3. Das, S., Sikdar, B.K.: A scalable test structure for multicore chip. IEEE Trans. CAD Integr. Circ. Syst. 29(1), 127–137 (2010)

    Article  Google Scholar 

  4. L’Ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22 (2007)

    Article  MathSciNet  Google Scholar 

  5. Marsaglia, G.: DIEHARD: a battery of tests of randomness (1996). http://stat.fsu.edu/ geo/diehard.html

  6. Sethi, B., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity (2016). doi:10.1002/cplx.21749

    Google Scholar 

  7. Smith III, A.R.: Cellular automata complexity trade-offs. Inf. Control 18, 466–482 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math. 7(2), 123–169 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wuensche, A.: Complex and chaotic dynamics, basins of attraction, and memory in discrete networks. Acta Phys. Pol. B-Proc. Suppl 3, 463–478 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, 711103, West Bengal, India

    Kamalika Bhattacharjee, Dipanjyoti Paul & Sukanta Das

Authors
  1. Kamalika Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dipanjyoti Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamalika Bhattacharjee .

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

Bhattacharjee, K., Paul, D., Das, S. (2016). Pseudorandom Pattern Generation Using 3-State Cellular Automata. 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_1

Download citation

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

  • 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