{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T12:28:19Z","timestamp":1750422499284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031569425"},{"type":"electronic","value":"9783031569432"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56943-2_11","type":"book-chapter","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T17:01:40Z","timestamp":1713459700000},"page":"137-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterization of 3-State Cellular Automata with\u00a0Single Length Cycles"],"prefix":"10.1007","author":[{"given":"Sukanya","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakkula","family":"Sindhuja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,19]]},"reference":[{"issue":"1\u20132","key":"11_CR1","first-page":"81","volume":"12","author":"S Adak","year":"2016","unstructured":"Adak, S., Naskar, N., Maji, P., Das, S.: On synthesis of non-uniform cellular automata having only point attractors. J. Cell. Autom. 12(1\u20132), 81\u2013100 (2016)","journal-title":"J. Cell. Autom."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Chady, M., Poli, R.: Evolution of cellular automaton based associative memories. Technical Report no. CSRP-97-15 (1997)","DOI":"10.1007\/978-1-4471-0427-8_5"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.25088\/ComplexSystems.30.3.415","volume":"30","author":"B Chakraborty","year":"2021","unstructured":"Chakraborty, B., Dalui, M., Sikdar, B.K.: Synthesis of scalable single length cycle, single attractor cellular automata in linear time. Complex Syst. 30(3), 415\u2013439 (2021)","journal-title":"Complex Syst."},{"key":"11_CR4","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chatterjee, S.: Additive Cellular Automata \u2013 Theory and Applications, vol.\u00a01. IEEE Computer Society Press, USA (1997). ISBN 0-8186-7717-1"},{"issue":"10","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/12.467703","volume":"44","author":"D Chowdhury","year":"1995","unstructured":"Chowdhury, D., Gupta, I., Chaudhuri, P.: A low-cost high-capacity associative memory design using cellular automata. IEEE Trans. Comput. 44(10), 1260\u20131264 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0020-0255(92)90053-B","volume":"61","author":"AK Das","year":"1992","unstructured":"Das, A.K., Sanyal, A., Palchaudhuri, P.: On characterization of cellular automata with matrix algebra. Inf. Sci. 61(3), 251\u2013277 (1992)","journal-title":"Inf. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Das, S., Mukherjee, S., Naskar, N., Sikdar, B.K.: Characterization of single cycle ca and its application in pattern classification. In: Electronic Notes in Theoretical Computer Science, vol. 252, pp. 181\u2013203 (2009)","DOI":"10.1016\/j.entcs.2009.09.021"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-15979-4_32","volume-title":"Cellular Automata","author":"S Das","year":"2010","unstructured":"Das, S., Naskar, N.N., Mukherjee, S., Dalui, M., Sikdar, B.K.: Characterization of CA rules for SACA targeting detection of faulty nodes in WSN. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 300\u2013311. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15979-4_32"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1109\/TSMCB.2002.806494","volume":"34","author":"N Ganguly","year":"2004","unstructured":"Ganguly, N., Maji, P., Sikdar, B., Pal Chaudhuri, P.: Design and characterization of cellular automata based associative memory for pattern recognition. IEEE Trans. Syst. Man Cybern. B Cybern. 34(1), 672\u2013678 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"11_CR10","unstructured":"Ganguly, N.: Cellular automata evolution: theory and applications in pattern recognition and classification. Ph.D. thesis, Bengal Engineering College (a Deemed University), India (2004)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45307-5_11","volume-title":"High Performance Computing \u2014 HiPC 2001","author":"N Ganguly","year":"2001","unstructured":"Ganguly, N., Das, A., Maji, P., Sikdar, B.K., Pal Chaudhuri, P.: Evolving cellular automata based associative memory for pattern recognition. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds.) HiPC 2001. LNCS, vol. 2228, pp. 115\u2013124. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45307-5_11"},{"key":"11_CR12","first-page":"27","volume":"14","author":"S Kamilya","year":"2019","unstructured":"Kamilya, S., Adak, S., Das, S., Sikdar, B.K.: SACAS: (non-uniform) cellular automata that converge to a single fixed point. J. Cell. Automata 14, 27\u201349 (2019)","journal-title":"J. Cell. Automata"},{"issue":"1\u20133","key":"11_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theoret. Comput. Sci. 334(1\u20133), 3\u201333 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR14","first-page":"321","volume":"58","author":"P Maji","year":"2003","unstructured":"Maji, P., Shaw, C., Ganguly, N., Sikdar, B.K., Chaudhuri, P.P.: Theory and application of cellular automata for pattern classification. Fund. Inform. 58, 321\u2013354 (2003)","journal-title":"Fund. Inform."},{"key":"11_CR15","unstructured":"Maji, P.: Cellular Automata Evolution for Pattern Recognition. Ph.D. thesis, Jadavpur University, Kolkata, India (2005)"},{"key":"11_CR16","first-page":"369","volume":"78","author":"P Maji","year":"2007","unstructured":"Maji, P., Chaudhuri, P.P.: RBFFCA: a hybrid pattern classifier using radial basis function and fuzzy cellular automata. Fund. Inform. 78, 369\u2013396 (2007)","journal-title":"Fund. Inform."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Naskar, M.B.: 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":"11_CR18","doi-asserted-by":"crossref","unstructured":"Naskar, N., Adak, S.: Designing multi-class pattern classifier using ca under periodic boundary condition. In: 2018 Fifth International Conference on Emerging Applications of Information Technology (EAIT), pp.\u00a01\u20134 (2018)","DOI":"10.1109\/EAIT.2018.8470434"},{"issue":"5\u20136","key":"11_CR19","first-page":"431","volume":"7","author":"N Naskar","year":"2012","unstructured":"Naskar, N., Das, S., Sikdar, B.K.: Characterization of nonlinear cellular automata having only single length cycle attractors. J. Cell. Autom. 7(5\u20136), 431\u2013453 (2012)","journal-title":"J. Cell. Autom."},{"issue":"S1","key":"11_CR20","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":"11_CR21","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)"}],"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-031-56943-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T17:02:54Z","timestamp":1713459774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56943-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031569425","9783031569432"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56943-2_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 April 2024","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":"Durgapur","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ascat2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nitdgp.ac.in\/ascat2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 Invited Paper","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}