{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T18:52:33Z","timestamp":1781981553247,"version":"3.54.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032186119","type":"print"},{"value":"9783032186126","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-18612-6_19","type":"book-chapter","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T04:58:37Z","timestamp":1771822717000},"page":"253-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Design of\u00a0Non-Uniform Elementary Asynchronous Cellular Automata for\u00a0Pattern Classification"],"prefix":"10.1007","author":[{"given":"Sukanya","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joydip","family":"Paul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2021.106018","volume":"104","author":"PP Balbi","year":"2022","unstructured":"Balbi, P.P., de Mattos, T., Ruivo, E.: Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates. Commun. Nonlinear Sci. Numer. Simul. 104, 106018 (2022)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.25088\/ComplexSystems.32.3.271","volume":"32","author":"K Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, K., Paul, S., Das, S.: Affinity classification problem by stochastic cellular automata. Complex Syst. 32(3), 271\u2013288 (2022)","journal-title":"Complex Syst."},{"key":"19_CR3","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive cellular automata: theory and applications, Volume 1, vol.\u00a01. John Wiley and Sons (1997)"},{"issue":"09","key":"19_CR4","doi-asserted-by":"publisher","first-page":"2250121","DOI":"10.1142\/S0129183122501212","volume":"33","author":"P Concha-Vega","year":"2022","unstructured":"Concha-Vega, P., Goles, E., Montealegre, P., R\u00edos-Wilson, M., Santiva\u00f1ez, J.: Introducing the activity parameter for elementary cellular automata. Int. J. Mod. Phys. C 33(09), 2250121 (2022)","journal-title":"Int. J. Mod. Phys. C"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Das, S., Sikdar, B.: Non-uniform cellular automata (2026)","DOI":"10.1007\/978-3-032-00257-0"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Fates, N.: A note on the classification of the most simple asynchronous cellular automata. In: International Workshop on Cellular Automata and Discrete Complex Systems, pp. 31\u201345. Springer (2013)","DOI":"10.1007\/978-3-642-40867-0_3"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00224-012-9386-3","volume":"53","author":"N Fat\u00e8s","year":"2013","unstructured":"Fat\u00e8s, N.: Stochastic cellular automata solutions to the density classification problem: when randomness helps computing. Theory Comput. Syst. 53(2), 223\u2013242 (2013)","journal-title":"Theory Comput. Syst."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Fat\u00e8s, N.: Asynchronous cellular automata. In: Cellular Automata, pp. 73\u201392. Springer (2018)","DOI":"10.1007\/978-1-4939-8700-9_671"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11047-020-09782-7","volume":"19","author":"N Fat\u00e8s","year":"2020","unstructured":"Fat\u00e8s, N.: A tutorial on elementary cellular automata with fully asynchronous updating: general properties and convergence dynamics. Nat. Comput. 19(1), 179\u2013197 (2020)","journal-title":"Nat. Comput."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gallant, S.I.: Neural network learning and expert systems. MIT press (1993)","DOI":"10.7551\/mitpress\/4931.001.0001"},{"key":"19_CR11","unstructured":"Ganguly, N.: Cellular automata evolution: theory and applications in pattern recognition and classification. India: Doctor Dissertation of CST Dept. BECDU (2003)"},{"key":"19_CR12","unstructured":"Maji, P.: Cellular automata evolution for pattern recognition. Ph.D. thesis, PhD thesis, Jadavpur University, Kolkata, India (2005)"},{"key":"19_CR13","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR14","unstructured":"Sethi, B.: Theory and applications of fully asynchronous cellular automata. Ph.D. thesis, Indian Institute of Engineering Science and Technology, Shibpur (2018)"},{"issue":"S1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1002\/cplx.21749","volume":"21","author":"B Sethi","year":"2016","unstructured":"Sethi, B., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity 21(S1), 370\u2013386 (2016)","journal-title":"Complexity"},{"key":"19_CR16","unstructured":"Von\u00a0Neumann, J., et\u00a0al.: Theory of self-reproducing automata (1966)"},{"key":"19_CR17","unstructured":"Wolfram, S.: A new kind of science (wolfram media, inc., 2002). http:\/\/www.wolframscience.com\/nksonline\/toc.html"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601 (1983)","journal-title":"Rev. Mod. Phys."},{"issue":"5985","key":"19_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1038\/311419a0","volume":"311","author":"S Wolfram","year":"1984","unstructured":"Wolfram, S.: Cellular automata as models of complexity. Nature 311(5985), 419\u2013424 (1984)","journal-title":"Nature"},{"issue":"1\u20132","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-2789(84)90245-8","volume":"10","author":"S Wolfram","year":"1984","unstructured":"Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D 10(1\u20132), 1\u201335 (1984)","journal-title":"Physica D"}],"container-title":["Communications in Computer and Information Science","Cellular Automata Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-18612-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T18:19:17Z","timestamp":1781979557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-18612-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032186119","9783032186126"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-18612-6_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Cellular Automata Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calicut","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ascat2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cellularautomata.in\/ascat2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}