{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T05:57:21Z","timestamp":1771826241299,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"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_18","type":"book-chapter","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T04:58:38Z","timestamp":1771822718000},"page":"238-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Study of\u00a0Non-uniform Cellular Automata with\u00a0Fully Asynchronous Updating : First Results on\u00a0the\u00a0Non-convergent Cases"],"prefix":"10.1007","author":[{"given":"Sukanya","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Mayukh","family":"Chatterjee","sequence":"additional","affiliation":[]},{"given":"Ahana","family":"Majumdar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,24]]},"reference":[{"key":"18_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":"09","key":"18_CR2","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":"18_CR3","unstructured":"Das, S.: Theory and Applications of Nonlinear Cellular Automata In VLSI Design. Ph.D. thesis, Bengal Engineering and Science University, Shibpur, India (2007)"},{"issue":"5\u20136","key":"18_CR4","first-page":"387","volume":"9","author":"N Fat\u00e8s","year":"2014","unstructured":"Fat\u00e8s, N.: Guided tour of asynchronous cellular automata. J. Cell. Autom. 9(5\u20136), 387\u2013416 (2014)","journal-title":"J. Cell. Autom."},{"key":"18_CR5","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":"18_CR6","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":"18_CR7","doi-asserted-by":"crossref","unstructured":"Fat\u00e8s, N., Sethi, B., Das, S.: On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view. In: Reversibility and Universality: Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday, pp. 313\u2013332. Springer (2018)","DOI":"10.1007\/978-3-319-73216-9_15"},{"issue":"1\u20133","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2006.05.036","volume":"362","author":"N Fates","year":"2006","unstructured":"Fates, N., Thierry, \u00c9., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoret. Comput. Sci. 362(1\u20133), 1\u201316 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR9","volume-title":"Introduction to probability, the chance project version dated 4 July 2006 of the second revised edition, 1997","author":"CM Grinstead","year":"2003","unstructured":"Grinstead, C.M., Snell, J.L.: Introduction to probability, the chance project version dated 4 July 2006 of the second revised edition, 1997. American Mathematical Society, Rhode Island, USA (2003)"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.25088\/ComplexSystems.30.2.205","volume":"30","author":"S Mukherjee","year":"2021","unstructured":"Mukherjee, S., Bhattacharjee, K., Das, S.: Clustering using cyclic spaces of reversible cellular automata. Complex Syst. 30(2), 205\u2013237 (2021)","journal-title":"Complex Syst."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Naskar, N.: Characterization and Synthesis of Non-Uniform Cellular Automata with Point State Attractors. Ph.D. thesis, Indian Institute of Engineering Science and Technology, Shibpur, India (2015)","DOI":"10.1007\/978-3-319-44365-2_6"},{"key":"18_CR12","unstructured":"Pal\u00a0Chaudhuri, P., Roy\u00a0Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata \u2013 Theory and Applications, vol.\u00a01. IEEE Computer Society Press, USA, ISBN 0-8186-7717-1 (1997)"},{"key":"18_CR13","unstructured":"Patel, E.L., Broomhead, D.: A max-plus model of asynchronous cellular automata. arXiv preprint arXiv:1502.04097 (2015)"},{"issue":"08","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2250013","DOI":"10.1142\/S0219525922500138","volume":"25","author":"S Roy","year":"2022","unstructured":"Roy, S., Das, S.: Clouds in the basins of fully asynchronous cellular automata. Adv. Complex Syst. 25(08), 2250013 (2022)","journal-title":"Adv. Complex Syst."},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114721","volume":"1011","author":"S Roy","year":"2024","unstructured":"Roy, S., Fat\u00e8s, N., Das, S.: Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence. Theoret. Comput. Sci. 1011, 114721 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR16","unstructured":"Sethi, B.: Theory and applications of fully asynchronous cellular automata. Ph.D. thesis, Indian Institute of Engineering Science and Technology, Shibpur (2018)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Sethi, B., Fat\u00e8s, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: International Conference on Theory and Applications of Models of Computation, pp. 39\u201349. Springer (2014)","DOI":"10.1007\/978-3-319-06089-7_4"},{"issue":"S1","key":"18_CR18","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"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T04:58:41Z","timestamp":1771822721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-18612-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032186119","9783032186126"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-18612-6_18","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"}}]}}