CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Cellular Automata and their Applications: A Review

by Vasantha Murali Krishna, Sangita Mishra, Jagadish Gurrala
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 184 - Number 5
Year of Publication: 2022
Authors: Vasantha Murali Krishna, Sangita Mishra, Jagadish Gurrala
10.5120/ijca2022922010

Vasantha Murali Krishna, Sangita Mishra, Jagadish Gurrala . Cellular Automata and their Applications: A Review. International Journal of Computer Applications. 184, 5 ( Mar 2022), 21-31. DOI=10.5120/ijca2022922010

@article{ 10.5120/ijca2022922010,
author = { Vasantha Murali Krishna, Sangita Mishra, Jagadish Gurrala },
title = { Cellular Automata and their Applications: A Review },
journal = { International Journal of Computer Applications },
issue_date = { Mar 2022 },
volume = { 184 },
number = { 5 },
month = { Mar },
year = { 2022 },
issn = { 0975-8887 },
pages = { 21-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume184/number5/32328-2022922010/ },
doi = { 10.5120/ijca2022922010 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:20:42.578448+05:30
%A Vasantha Murali Krishna
%A Sangita Mishra
%A Jagadish Gurrala
%T Cellular Automata and their Applications: A Review
%J International Journal of Computer Applications
%@ 0975-8887
%V 184
%N 5
%P 21-31
%D 2022
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper author reports a detail study on the convergence of the one-dimensional two-state 3 neighborhood asynchronous cellular automata (ACA) under null theory.

References
  1. Evolving Cellular Automata as Pattern Classifier, October 2002.
  2. K. Dihidar S. Mitra A. R. Khan, P. P. Choudhuryand P. SARKAR.VLSI architecture of a cellular automata machine. Computers Math. Applic. Else- vierScience Ltd, 33(5):79–94, September 1997.
  3. SusriSangeeta Mishra Alka Singh. Cryptographic Algorithm Using Cellular Automata Rules. International Journal of Computer Applica- tion, 3:58–64, MAY-July 2014.
  4. LAURA DIOSAN, ANCA ANDREICA, and Alina Enescu. ”The Use Of Simple Cellular Automata In Image Processing”. Informatica, LXII(1):5–14, November 2017.
  5. E. R. Berlekamp, J. H. Conway, and R. K. Guy. Winning ways for yourmathe- matical plays, volume 2. Academic Press, 1984.
  6. Martin L. Brady and RaghuRaghavan. ”Probabilistic Cellular Au- Tomata In Pattern Recognition”. Joseph Slawny, VA 24061(325):177–182.
  7. P. Joshi D. Mukhopadhyay and D. RoyChowdhury. VLSI architecture of a cellular automata based one-way function. Journal Of Computers, 3(5):46–53, May 2008.
  8. Debasis Das. A Survey on Cellular Automata and Its Applications. In Communi- cations in Computer and Information Science, pages 753–761, December 2011.
  9. Sukanta Das, Sukanya Mukherjee, NazmaNaskar, and Biplab K. Sikdar. Char- acterization of single cycle caand its application in pattern classification. Electr. Notes Theor. Comput. Sci., 252:181–203, 2009.
  10. H. O. Peitgen F . v. Haesler and G. Skordev. Cellular Automata, Matrix Substitu- tions and Fractals. Annals of Math ematics and Artficial Intelligence, 8:345–362,1993.
  11. A. C. A. NascimentoFlavio du Pin Calmon, Felipe Miranda Costa and A. R. S.Romariz. A VLSI implementation of a linear cellular automata test-bed.
  12. A. Thanailakis V. Mardiris G.Ch. Sirakoulis, I. Karafyllidis. A methodology for VLSI implementation of cellular automata algorithms using VHDL. Advances in Engineering Software Elsevier Science Ltd, 32:189–202, 2001.
  13. P. Guan. Cellular automaton public-key cryptosystems. Complex Systems, 1, 1987.
  14. HowardGutowitz. Cryptography with dynamical systems. In N. Boccara, E. Goles, S. Martinez, and P Picco, editors, Cellular Automata and Cooperative Phenomena, pages 237–274. Kluwer Academic Publishers, 1993.
  15. KarelCulik II and SimantDube. Fractal and Recurrent Behavior of CellularAutomata. Complex Systems, (3):253–267, 1989.
  16. J. Ashwini Pricilla J. ArockiaAruldoss. Mathematical Model of Cellular Automata and Fractals in Cancer Growth. International Journal of Computing Algorithm,03:853–856, May 2014.
  17. REINHARD F. WERNER JOHANNES GU TSCHOW, VINCENT NESME. ”The fractal structure of cellular automata on Abelian groups”. arXiv, 0313v1(1011), November 2010.
  18. PabitraMitra Joy Deep Nath and NiloyGanguly. Scalable Evolutionary Design of CA Pattern Classifier.
  19. KamalikaBhattacharjee, N azma N askar, Souvik Roy and Sukanta Das. A Survey of C ellular Automata: T ypes, Dynamics, N on−uniformity and Applications. ACM Computing Surveys, V(N):A:1–A:34, 21 september 2016.
  20. J. Kari. Cryptosystems based on reversible cellular automata. preprint, April 1992.
  21. AbdulRaouf Khan. On two dimensional cellular automata and its VLSI appli- cations. International Journal of Electrical & Computer Sciences IJECS-IJENS,10(6):124–129, December 2010.
  22. P. Maji and P Pal Chaudhuri. Fuzzy cellular automata for modeling pattern classifier. IEICE Transactions on Information and Systems, E88-D(4):691–702, April 2005.
  23. PradiptaMaji, Chandrama Shaw, NiloyGanguly, Biplab K. Sikdar, and P. Pal Chaudhuri. Theory and Application of Cellular Automata For Pattern Classifica- tion. FundamentaInformaticae, 58:321–354, 2003.
  24. MathieuPerrenoud Marco Tomassini. ”N onuniform Cellular Automata for Cryptography”. Complex Systems Publications, Inc., 12:71–81, 2000.
  25. MathieuPerrenoud Marco Tomassini. ”C ryptographywith cellular automata”.ELSEVIER, pages 151–160, 4 July 2001.
  26. Bruno Martin. Inherent Generation of Fractals by Cellular Automata. Complex,Systems, (8):347–366, 1994.
  27. Bhupalam Harish Kumar MD Sadiq. ”Efficient Cryptography using C ellular Automata Rules”. International Journal of Emerging Engineering Research and Technology, 3:18–25, December 2015.
  28. Maji P. F M AC A: A F uzzy C ellular Automata Based C lassifier. In in Proceeding of 9th International Conference on Database Systems, Korea, pages 494–505, March2002.
  29. Dr. Inampudi Ramesh Babu P. KiranSree. ”I dentification of P rotein C oding Regions in Genomic DN A U sing U nsupervised F M AC A Based P attern C lassifier”. IJCSNS International Journal of Computer Science and Network Se- curity, 8(1):305–309, january 2008.
  30. Inampudi Ramesh Babu P. KiranSree and N. Usha Devi. Psmaca: An automated protein structure prediction using mac (multiple attractor cellular automata).
  31. DeepakRanjanNayak, Prashanta Kumar Patra and AmitavMahapatra. ”a survey on two dimensional cellular automata and its application in image processing”.
  32. Paul L. Rosin. Training Cellular Automata for Image Processing. Springer-VerlagBerlin Heidelberg, (LNCS 3540):195–204, 2005.
  33. SSSNUsha Devi .N PokkuluriKiranSree, Inampudi Ramesh Babu. ”C ellular Automata and I ts Applications in Bioinformatics: A Review”. Global Perspectives on Artificial Intelligence (GPAI), 2:16–22, April 2014.
  34. Inampudi Ramesh BabuPokkuluri.KiranSree and SSSN Usha Devi Nedunuri.”M ultiple Attractor C ellular Automata (M AC A) for Addressing M ajor P roblems in Bioinformatics”. Review of Bioinformatics and Biometrics (RBB), 2:70–76, September 2013.
  35. AdrianaPopovici and Dan Popovici. Cellular Automata in Image Processing. 1900.
  36. W. Pries, A. Thanailakis, and H. C. Card. Group properties of cellular au- tomata and VLSI applications. IEEE TRANSACTIONS ON COMPUTERS, C-(12):1013–1024, December 1986.
  37. Dr. Inampudi Ramesh Babu Prof PokkuluriKiranSree and Smt S.S.S.N. Usha DeviNedunuri. ”H M AC A: T owards P roposinga Cellular Automata Based T ool for Protein Coding, Promoter Region Identification and Protein Structure Prediction”.
  38. P.P. Chaudhuri S. Nandi, B.K. Kar. ”T heory and applications of cellular automata in cryptography”. IEEE Trans. Comput., 43(12):1346–1357, 1994.
  39. Saiida LAZAAR Said BOUCHKAREN. ”A F ast Cryptosystem U sing Reversible C ellular Automata”. (IJACSA) International Journal of Advanced ComputerSci- ence and Applications, 5(5):207–210, 2014.
  40. Palash Sarkar. A BreifHistory of Cellular Automata. ACM Computing Surveys,32(1):80–107, March 2000.
  41. Sartra W ongthanavasu and J etsada P onkaew. Cellular Automata for PatternRecognition. pages 53–67.
  42. C. L. Seitz. Concurrent VLSI architectures. IEEE Trans. Comput., C-33:1247–1265, December 1984.
  43. FranciszekSeredynski, Pascal Bouvry, and Albert Y. Zomaya. ”Secret Key Cryptography with Cellular Automata”. August 2003.
  44. Biswanath Sethi1 and Sukanta Das. ”On the U se of Asynchronous C ellular Automata in Symmetric−Key C ryptography”. Springer Nature Singapore Pte Ltd., pages 30–41, 4 July 2016.
  45. KiranSree and Ramesh Babu. I dentification of P romoterRegion in Genomic DN A U sing C ellular Automata Based T ext C lustering. The International Arab Journal of Information Technology, 7(1):75–78, January 2010.
  46. NazmaNaskarSukanta Das, Sukanya Mukherjee and Biplab K Sikdar. ModelingSingle Length Cycle Nonlinear Cellular Automata For Pattern Recognition. IEEE, 978-1-4244-5612-3(09):198–203, 2009.
  47. S. Takahashi. ”Cellular Automata and Multi Fractals : Dimension Spectra of Linear Cellular Automata”. Physica D, 45:36–48, 1990.
  48. C. D. Thompson and H. T. Kung. Sorting on a mesh-connected parallel computer. Commun. Ass. Comput, Mach., 20:263–271, 1977.
  49. NITianjia. ”Some Properties of Fractals Generated by Linear Cellular Automata”. TSINGHUA SCIENCE AND TECHNOLOGY ISSN 1007-0214 09/23, 8(5):557–563, October 2003.
  50. John von Neumann. The theory of self-reproducing Automata, A. W. Burks ed. Univ. of Illinois Press, Urbana and London, 1966.
  51. Stephen J. WILLSON. Cellular Automata Can Generate Fractals. Discrete AppliedMathematics, 8:91–99, 1984.
  52. S. Wolfram. Statistical mechanics of cellular automata. Rev. Mod. Phys., 55(3):601–644, July 1983.
  53. S. Wolfram. ”Universality and Complexity in Cellular Automata”. Physica D, 10:1–35, 1984.
  54. S. Wolfram. Cryptography with Cellular Automata. Advances in Cryptology - Crypto’85, Springer-Verlag, 218:429–432, 1986.
  55. S. Wolfram. Theory and applications of cellular automata. World Scientific, Sin- gapore, 1986. ISBN 9971-50-124-4pbk.
  56. Jagadishgurrala, et al., “Investigation and Analysis of Location based Authentication and Security Services of Wireless LAN's and Mobile Devices”, International Journal of Computer Applications(IJCA), Volume 146-No.8, July 2016.
  57. Jagadishgurrala, et al., “A Study of Low Power Consumable Frameworks for Hiding Audio signals in Image Container Using Different Steganography techniques Using ARM Controller Devices For Smart Living”,I J C T A, ©SCOPUS, SCI indexed International Science Press, Volume 9, 2016, pp. 261-269,ISSN: 0974-5572, Jan 2017.
  58. Jagadishgurrala, et al., “Analysis of Existing Text Hiding Algorithms For Image Steganography Using TLNUS and AES”, Smart Computing and Informatics, Proceedings on SCI 2016, Volume 7, pp © Springer Nature Singapore Pte Ltd. 2018, Systems and Technologies 77, https://doi.org/10.1007/978-981-10-5544-7_1, Dec 2017.
  59. JagadishGurrala et al, “A Secure framework for Communicating Multimedia Data in Cover Images Using Hybrid Steganography Algorithms in Wireless Local Area Network”,International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-9 Issue-2S3, December 2019 .
Index Terms

Computer Science
Information Sciences

Keywords

Convergence fixed point attractor multi-state attractor

Powered by PhDFocusTM