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.
This work is supported by DST Fast Track Project Fund (No. SR/FTP/ETA0071/2011).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Neumann, J.V. In: Burks, A.W. (ed.) The Theory of Self-Reproducing Automata. University of Illinois Press, Urbana and London (1966)
Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore (1986). ISBN: 9971-50-124-4 pbk
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-1
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)
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)
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)
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)
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)
Ganguly, N.: Cellular automata evolution : theory and applications in pattern recognition and classification. PhD thesis, Bengal Engineering College (a Deemed University), India (2004)
Maji, P.: Cellular Automata evolution for pattern recognition. PhD thesis, Jadavpur University, Kolkata, India (2005)
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)
Maji, P., Chaudhuri, P.P.: Fuzzy cellular automata for modeling pattern classifier. IEICE Trans. Inform. Syst. E88-D(4), 691–702 (2005)
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)
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)
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 2013
Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21(1), 71–84 (2012)
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)
Garzon, M.: Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks. Springer, Berlin (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Japan
About this chapter
Cite this chapter
Sethi, B., Das, S. (2015). Convergence of Asynchronous Cellular Automata (Under Null Boundary Condition) and Their Application in Pattern Classification. In: Suzuki, Y., Hagiya, M. (eds) Recent Advances in Natural Computing. Mathematics for Industry, vol 9. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55105-8_3
Download citation
DOI: https://doi.org/10.1007/978-4-431-55105-8_3
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-55104-1
Online ISBN: 978-4-431-55105-8
eBook Packages: EngineeringEngineering (R0)