Convergence of Asynchronous Cellular Automata (Under Null Boundary Condition) and Their Application in Pattern Classification

Chapter
Part of the Mathematics for Industry book series (MFI, volume 9)

Abstract

This paper studies the convergence of one-dimensional 3-neighborhood two-state asynchronous cellular automata (ACA), and utilizes the convergence property of ACA in designing pattern classifier. Here, we consider the cellular automata as fully asynchronous and the boundary condition of ACA as null. As a result of our current study, a directed graph, named fixed-point graph (FPG) is proposed to identify the fixed-point attractors in an automaton. A theorem is reported to characterize ACA having fixed-points in their state space. 184 (out of 256) ACA are identified with fixed-point attractors utilizing the theorem. All the ACA with fixed-points, however, may not converge always to fixed-point attractors. We report another theorem to understand the convergence of ACA. Following this theorem, 137 (out of 184) ACA are identified, which always converge to some fixed-point attractors. Then, we exploit the convergence property of ACA in designing pattern classifier. However, ACA with multiple fixed-point attractors can only be the candidate in the said design. Exploring the FPG, we further identify 74 ACA (out of 137) having at least two fixed-points under null boundary condition, which are utilized in design of an efficient 2-class pattern classifier. Finally, the designed classifier is tested with real-life data sets, and the performance of the classifier is compared with other well-known classifiers. It is observed that the proposed classifier performs better than many other well-known classifiers, and also better than synchronous Cellular automata (CA) based classifier.

Keywords

Asynchronous cellular automata (ACA) Convergence Fixed-point attractors Fixed-point graph (FPG) Pattern classification 

References

  1. 1.
    Neumann, J.V. In: Burks, A.W. (ed.) The Theory of Self-Reproducing Automata. University of Illinois Press, Urbana and London (1966)Google Scholar
  2. 2.
    Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore (1986). ISBN: 9971-50-124-4 pbkGoogle Scholar
  3. 3.
    Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chatterjee, S. In: Additive Cellular Automata—Theory and Applications, vol. 1. IEEE Computer Society Press, USA (1997). ISBN: 0-8186-7717-1Google Scholar
  4. 4.
    Wuensche, A., Lesser, M.: The Global Dynamics of Cellular Automata. In: Santa Fe Institute Studies in the Sciences of Complexity, vol 1. Addison-Wesley, Boston (1992). IBSN: 0-201-55740-1 (Volume reference)Google Scholar
  5. 5.
    Das, S., Mukherjee, S., Naskar, N., Sikdar, B.K.: Characterization of single cycle ca and its application in pattern classification. Electr. Notes Theor. Comput. Sci. 252, 181–203 (2009)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Das, S., Mukherjee, S., Naskar, N., Sikdar, B.K.: Modeling single length cycle nonlinear cellular automata for pattern recognition. In: NaBIC, pp. 198–203 (2009)Google Scholar
  7. 7.
    Ganguly, N., Das, A., Maji, P., Sikdar, B.K., Chaudhuri, P.P.: Evolution of cellular automata based associative memory for pattern recognition. In: High Performance Computing, Hyderabad, India (2001)Google Scholar
  8. 8.
    Ganguly, N., Maji, P., Dhar, S., Sikdar, B.K., Chaudhuri, P.P.: Evolving cellular automata as pattern classifier. ACRI, LNCS, vol. 2494, pp. 56–68 (2002) Google Scholar
  9. 9.
    Ganguly, N.: Cellular automata evolution : theory and applications in pattern recognition and classification. PhD thesis, Bengal Engineering College (a Deemed University), India (2004)Google Scholar
  10. 10.
    Maji, P.: Cellular Automata evolution for pattern recognition. PhD thesis, Jadavpur University, Kolkata, India (2005)Google Scholar
  11. 11.
    Ganguly, N., Maji, P., Das, A., Sikdar, B.K., Chaudhuri, P.P.: Characterization of non-linear cellular automata model for pattern recognition. In: AFSS International Conference on Fuzzy Systems, Calcutta, India, pp. 214–220 (2002)Google Scholar
  12. 12.
    Maji, P., Chaudhuri, P.P.: Fuzzy cellular automata for modeling pattern classifier. IEICE Trans. Inform. Syst. E88-D(4), 691–702 (2005)Google Scholar
  13. 13.
    Suzuko, T.: Searching for pattern-forming asynchronous cellular automata-an evolutionary approach. In: Proceedings of International Conference on Cellular Automata for Research and Industry, ACRI, Greece, Springer, pp. 151–160 (2004)Google Scholar
  14. 14.
    Suzuko, T.: Spatial pattern formation in asynchronous cellular automata with mass conservation. Physica A: Statistical Mechanics and Its Applications, vol. 343, pp. 185–200. Elsevier, New York (2004)Google Scholar
  15. 15.
    Sethi, B., Das, S.: Modeling of asynchronous cellular automata with fixed-point attractors for pattern classification. In: Proceedings of International Conference on High Performance Computing and Simulation, IEEE, pp. 311–317, July 2013Google Scholar
  16. 16.
    Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21(1), 71–84 (2012)MathSciNetGoogle Scholar
  17. 17.
    Fatès, N., Thierry, E., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. 362(1–3), 1–16 (2006)MATHGoogle Scholar
  18. 18.
    Garzon, M.: Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks. Springer, Berlin (1995)Google Scholar

Copyright information

© Springer Japan 2015

Authors and Affiliations

  1. 1.Department of Information TechnologyBengal Engineering and Science UniversityShibpur HowrahIndia

Personalised recommendations