{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:04:30Z","timestamp":1782968670753,"version":"3.54.5"},"reference-count":320,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DST-INSPIRE","award":["DST\/INSPIRE Fellowship\/2013\/657"],"award-info":[{"award-number":["DST\/INSPIRE Fellowship\/2013\/657"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11047-018-9696-8","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T06:45:45Z","timestamp":1532328345000},"page":"433-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":100,"title":["A survey of cellular automata: types, dynamics, non-uniformity and applications"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1678-7595","authenticated-orcid":false,"given":"Kamalika","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nazma","family":"Naskar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Souvik","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sukanta","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"issue":"38\u201340","key":"9696_CR1","doi-asserted-by":"publisher","first-page":"3685","DOI":"10.1016\/j.tcs.2009.05.004","volume":"410","author":"L Acerbi","year":"2009","unstructured":"Acerbi L, Dennunzio A, Formenti E (2009) Conservation of some dynamical properties for operations on cellular automata. Theor Comput Sci 410(38\u201340):3685\u20133693","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"9696_CR2","first-page":"81","volume":"12","author":"S Adak","year":"2016","unstructured":"Adak S, Naskar N, Maji P, Das S (2016) On synthesis of non-uniform cellular automata having only point attractors. J Cell Autom 12(1\u20132):81\u2013100","journal-title":"J Cell Autom"},{"issue":"4","key":"9696_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0895-7177(96)00006-4","volume":"23","author":"AI Adamatzky","year":"1996","unstructured":"Adamatzky AI (1996) Computation of shortest path in cellular automata. Math Comput Model 23(4):105\u2013113","journal-title":"Math Comput Model"},{"issue":"1","key":"9696_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0375-9601(95)00372-A","volume":"203","author":"C Adami","year":"1995","unstructured":"Adami C (1995) Self-organized criticality in living systems. Phys Lett A 203(1):29\u201332","journal-title":"Phys Lett A"},{"key":"9696_CR5","first-page":"1","volume":"1","author":"J Albert","year":"1987","unstructured":"Albert J, Culik K II (1987) A simple universal cellular automaton and its one-way and totalistic version. Complex Syst 1:1\u201316","journal-title":"Complex Syst"},{"key":"9696_CR6","unstructured":"Albicki A, Khare M (1987) Cellular automata used for test pattern generation. In: Proceedings of international conference of computer design, pp 56\u201359"},{"issue":"2","key":"9696_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.25088\/ComplexSystems.18.2.195","volume":"18","author":"R Alonso-Sanz","year":"2009","unstructured":"Alonso-Sanz R, Bull L (2009) Elementary cellular automata with minimal memory and random number generation. Complex Syst 18(2):195\u2013213","journal-title":"Complex Syst"},{"issue":"1","key":"9696_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1090\/S0002-9939-1970-0276007-5","volume":"26","author":"S Amoroso","year":"1970","unstructured":"Amoroso S, Cooper G (1970) The garden-of-eden theorem for finite configurations. Proc Am Math Soc 26(1):158\u2013164","journal-title":"Proc Am Math Soc"},{"key":"9696_CR9","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S Amoroso","year":"1972","unstructured":"Amoroso S, Patt YN (1972) Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J Comput Syst Sci 6:448\u2013464","journal-title":"J Comput Syst Sci"},{"key":"9696_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0019-9958(66)90220-8","volume":"9","author":"MA Arbib","year":"1966","unstructured":"Arbib MA (1966) Simple self-reproducing universal automata. Inf Control 9:177\u2013189","journal-title":"Inf Control"},{"issue":"3","key":"9696_CR11","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","volume":"EC\u201314","author":"AJ Atrubin","year":"1965","unstructured":"Atrubin AJ (1965) A one-dimensional real-time iterative multiplier. IEEE Trans Electron Comput EC\u201314(3):394\u2013399","journal-title":"IEEE Trans Electron Comput"},{"issue":"1\u20132","key":"9696_CR12","first-page":"1","volume":"10","author":"P Banda","year":"2015","unstructured":"Banda P, Caughman J, Pospichal J (2015) Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem. J Cell Autom 10(1\u20132):1\u201321","journal-title":"J Cell Autom"},{"key":"9696_CR13","doi-asserted-by":"crossref","unstructured":"Banks ER (1970) Universality in cellular automata. In: Proceedings of IEEE conference record of 11th annual symposium on switching and automata theory, 1970. IEEE, pp 194\u2013215","DOI":"10.1109\/SWAT.1970.27"},{"key":"9696_CR14","unstructured":"Banks ER (1971) Information processing and transmission in cellular automata. Ph.D. thesis, MIT"},{"issue":"11","key":"9696_CR15","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/TC.2004.94","volume":"53","author":"F Bao","year":"2004","unstructured":"Bao F (2004) Cryptanalysis of a partially known cellular automata cryptosystem. IEEE Trans Comput 53(11):1493\u20131497","journal-title":"IEEE Trans Comput"},{"key":"9696_CR16","unstructured":"Bardell PH (1990) Analysis of cellular automata used as pseudo-random pattern generators. In: Proceedings of international test conference, pp 762\u2013768"},{"issue":"5","key":"9696_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0167-8191(00)00077-6","volume":"27","author":"A Beckers","year":"2001","unstructured":"Beckers A, Worsch T (2001) A perimeter-time ca for the queen bee problem. Parallel Comput 27(5):555\u2013569","journal-title":"Parallel Comput"},{"issue":"17","key":"9696_CR18","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1063\/1.118851","volume":"70","author":"SC Benjamin","year":"1997","unstructured":"Benjamin SC, Johnson NF (1997) A possible nanometer-scale computing device based on an adding cellular automaton. Appl Phys Lett 70(17):2321\u20132323","journal-title":"Appl Phys Lett"},{"issue":"3","key":"9696_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11047-013-9374-9","volume":"12","author":"H Betel","year":"2013","unstructured":"Betel H, de Oliveira PPB, Flocchini P (2013) Solving the parity problem in one-dimensional cellular automata. Nat Comput 12(3):323\u2013337","journal-title":"Nat Comput"},{"issue":"2\u20133","key":"9696_CR20","first-page":"213","volume":"11","author":"K Bhattacharjee","year":"2016","unstructured":"Bhattacharjee K, Das S (2016) Reversibility of $$d$$-state finite cellular automata. J Cell Autom 11(2\u20133):213\u2013245","journal-title":"J Cell Autom"},{"issue":"06","key":"9696_CR21","doi-asserted-by":"publisher","first-page":"1750\u2013078","DOI":"10.1142\/S0129183117500784","volume":"28","author":"K Bhattacharjee","year":"2017","unstructured":"Bhattacharjee K, Paul D, Das S (2017) Pseudo-random number generation using a 3-state cellular automaton. Int J Mod Phys C 28(06):1750\u2013078","journal-title":"Int J Mod Phys C"},{"key":"9696_CR22","doi-asserted-by":"crossref","unstructured":"Bhattacharjee S, Bhattacharya J, Chaudhuri PP (1995) An efficient data compression hardware based on cellular automata. In: Proceedings of data compression conference (DCC95), p 472","DOI":"10.1109\/DCC.1995.515582"},{"issue":"1","key":"9696_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02760680","volume":"99","author":"F Blanchard","year":"1997","unstructured":"Blanchard F, Maass A (1997) Dynamical properties of expansive one-sided cellular automata. Israel J Math 99(1):149\u2013174","journal-title":"Israel J Math"},{"key":"9696_CR24","doi-asserted-by":"publisher","first-page":"3876","DOI":"10.1103\/PhysRevE.59.3876","volume":"59","author":"HJ Blok","year":"1999","unstructured":"Blok HJ, Bergersen B (1999) Synchronous versus asynchronous updating in the \u201cgame of life\u201d. Phys Rev E 59:3876\u20133879","journal-title":"Phys Rev E"},{"key":"9696_CR25","doi-asserted-by":"publisher","first-page":"6007","DOI":"10.1088\/0305-4470\/31\/28\/014","volume":"31","author":"N Boccara","year":"1998","unstructured":"Boccara N, Fuk\u015b H (1998) Cellular automaton rules conserving the number of active sites. J Phys A Math Gen 31:6007","journal-title":"J Phys A Math Gen"},{"issue":"1\u20133","key":"9696_CR26","first-page":"1","volume":"52","author":"N Boccara","year":"2002","unstructured":"Boccara N, Fuk\u015b H (2002) Number-conserving cellular automaton rules. Fundam Inf 52(1\u20133):1\u201313","journal-title":"Fundam Inf"},{"issue":"03","key":"9696_CR27","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1142\/S0129183194000751","volume":"5","author":"N Boccara","year":"1994","unstructured":"Boccara N, Roger M (1994) Some properties of local and nonlocal site exchange deterministic cellular automata. Int J Modern Phys C 5(03):581\u2013588","journal-title":"Int J Modern Phys C"},{"key":"9696_CR28","volume-title":"Wholeness and the implicate order, ISBN 0-203-99515-5","author":"D Bohm","year":"1980","unstructured":"Bohm D (1980) Wholeness and the implicate order, ISBN 0-203-99515-5. Routledge, Abingdon"},{"issue":"4","key":"9696_CR29","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s11047-012-9340-y","volume":"11","author":"O Bour\u00e9","year":"2012","unstructured":"Bour\u00e9 O, Fat\u00e8s N, Chevrier V (2012) Probing robustness of cellular automata through variations of asynchronous updating. Nat Comput 11(4):553\u2013564","journal-title":"Nat Comput"},{"issue":"1\u20132","key":"9696_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-2789(84)90258-6","volume":"10","author":"C Burks","year":"1984","unstructured":"Burks C, Farmer D (1984) Towards modeling DNA sequences as automata. Phys D Nonlinear Phenom 10(1\u20132):157\u2013167","journal-title":"Phys D Nonlinear Phenom"},{"key":"9696_CR31","unstructured":"Capobianco S (2007) Surjectivity and surjunctivity of cellular automata in besicovitch topology. In: Proceedings of international workshop on cellular automata and discrete complex systems, AUTOMATA 2007"},{"issue":"1","key":"9696_CR32","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(98)00149-2","volume":"217","author":"G Cattaneo","year":"1999","unstructured":"Cattaneo G, Formenti E, Margara L, Mauri G (1999) On the dynamical behavior of chaotic cellular automata. Theor Comput Sci 217(1):31\u201351","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"9696_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(98)00345-4","volume":"244","author":"G Cattaneo","year":"2000","unstructured":"Cattaneo G, Finelli M, Margara L (2000) Investigating topological chaos by elementary cellular automata dynamics. Theor Comput Sci 244(1\u20132):219\u2013241","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9696_CR34","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2004.06.008","volume":"325","author":"G Cattaneo","year":"2004","unstructured":"Cattaneo G, Dennunzio A, Margara L (2004) Solution of some conjectures about topological properties of linear cellular automata. Theor Comput Sci 325(2):249\u2013271","journal-title":"Theor Comput Sci"},{"key":"9696_CR35","doi-asserted-by":"crossref","unstructured":"Cattaneo G, Dennunzio A, Formenti E, Provillard J (2009) Non-uniform cellular automata. In: Proceedings of 3rd international conference language and automata theory and applications, LATA, pp 302\u2013313","DOI":"10.1007\/978-3-642-00982-2_26"},{"issue":"3","key":"9696_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/43.489103","volume":"15","author":"K Cattell","year":"1996","unstructured":"Cattell K, Muzio JC (1996) Synthesis of one-dimensional linear hybrid cellular automata. IEEE Trans Comput Aided Design Integr Circuits Syst 15(3):325\u2013335","journal-title":"IEEE Trans Comput Aided Design Integr Circuits Syst"},{"issue":"2","key":"9696_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF00993091","volume":"6","author":"K Cattell","year":"1995","unstructured":"Cattell K, Zhang S (1995) Minimal cost one-dimensional linear hybrid cellular automata of degree through 500. J Electron Test Theory Appl 6(2):255\u2013258","journal-title":"J Electron Test Theory Appl"},{"issue":"2","key":"9696_CR38","doi-asserted-by":"publisher","first-page":"673","DOI":"10.5802\/aif.1686","volume":"49","author":"TG Ceccherini-Silberstein","year":"1999","unstructured":"Ceccherini-Silberstein TG, Machi A, Scarabotti F (1999) Amenable groups and cellular automata. Annales de l\u2019institut Fourier 49(2):673\u2013685","journal-title":"Annales de l\u2019institut Fourier"},{"key":"9696_CR39","doi-asserted-by":"crossref","unstructured":"Chakraborty R, Chowdhury DR (2009) A novel seed selection algorithm for test time reduction in BIST. In: Proceedings of the 18th Asian test symposium, ATS 2009, Taiwan, pp 15\u201320","DOI":"10.1109\/ATS.2009.10"},{"issue":"7","key":"9696_CR40","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/12.508316","volume":"45","author":"S Chakraborty","year":"1996","unstructured":"Chakraborty S, Chowdhury DR, Chaudhuri PP (1996) Theory and application of non-group cellular automata for synthesis of easily testable finite state machines. IEEE Trans Comput 45(7):769\u2013781","journal-title":"IEEE Trans Comput"},{"issue":"5\u20136","key":"9696_CR41","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0898-1221(99)00227-8","volume":"38","author":"P Chattopadhyay","year":"1999","unstructured":"Chattopadhyay P, Choudhury PP, Dihidar K (1999) Characterisation of a particular hybrid transformation of two-dimensional cellular automata. Comput Math Appl 38(5\u20136):207\u2013216","journal-title":"Comput Math Appl"},{"issue":"6","key":"9696_CR42","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/92.902267","volume":"8","author":"S Chattopadhyay","year":"2000","unstructured":"Chattopadhyay S, Adhikari S, Sengupta S, Pal M (2000) Highly regular, modular, and cascadable design of cellular automata-based pattern classifier. IEEE Trans VLSI Syst 8(6):724\u2013735","journal-title":"IEEE Trans VLSI Syst"},{"key":"9696_CR43","volume-title":"Additive cellular automata\u2013theory and applications, ISBN 0-8186-7717-1","author":"PP Chaudhuri","year":"1997","unstructured":"Chaudhuri PP, Chowdhury DR, Nandi S, Chatterjee S (1997) Additive cellular automata\u2013theory and applications, ISBN 0-8186-7717-1, vol 1. IEEE Computer Society Press, Los Alamitos"},{"issue":"016","key":"9696_CR44","first-page":"107","volume":"63","author":"S Cheybani","year":"2000","unstructured":"Cheybani S, Kert\u00e9sz J, Schreckenberg M (2000) Stochastic boundary conditions in the deterministic nagel-schreckenberg traffic model. Phys Rev E 63(016):107","journal-title":"Phys Rev E"},{"key":"9696_CR45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549755","volume-title":"Cellular automata modeling of physical systems","author":"B Chopard","year":"1998","unstructured":"Chopard B, Droz M (1998) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge"},{"key":"9696_CR46","unstructured":"Chowdhury DR (1994) Theory and applications of additive cellular automata for reliable and testable VLSI circuit design. Ph.D. thesis, IIT, Kharagpur"},{"key":"9696_CR47","doi-asserted-by":"crossref","unstructured":"Chowdhury DR, Chakraborty S, Vamsi B, Chaudhuri PP (1993) Cellular automata based synthesis of easily and fully testable FSMs. In: Proceedings of international conference on computer aided design, ICCAD, pp 650\u2013653","DOI":"10.1109\/ICCAD.1993.580155"},{"issue":"6","key":"9696_CR48","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/12.286310","volume":"43","author":"DR Chowdhury","year":"1994","unstructured":"Chowdhury DR, Basu S, Gupta IS, Chaudhuri PP (1994) Design of CAECC\u2014cellular automata based error correcting code. IEEE Trans Comput 43(6):759\u2013764","journal-title":"IEEE Trans Comput"},{"key":"9696_CR49","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s10955-011-0202-2","volume":"143","author":"Z Cinkir","year":"2011","unstructured":"Cinkir Z, Akin H, Siap I (2011) Reversibilty of 1D cellular automata with periodic boundary over finite fields $$ {{\\mathbb{Z}}}_{p}$$. J Stat Phys 143:807\u2013823","journal-title":"J Stat Phys"},{"key":"9696_CR50","volume-title":"Cellular automata","author":"EF Codd","year":"1968","unstructured":"Codd EF (1968) Cellular automata. Academic Press Inc, Cambridge"},{"issue":"1","key":"9696_CR51","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1080\/00029890.1996.12004699","volume":"103","author":"B Codenotti","year":"1996","unstructured":"Codenotti B, Margara L (1996) Transitive cellular automata are sensitive. Am Math Mon 103(1):58\u201362","journal-title":"Am Math Mon"},{"key":"9696_CR52","first-page":"55","volume":"C\u201318","author":"SN Cole","year":"1969","unstructured":"Cole SN (1969) Real time computation by n-dimensional iterative arrays of finite state machines. IEEE Trans Comput C\u201318:55\u201377","journal-title":"IEEE Trans Comput"},{"key":"9696_CR53","doi-asserted-by":"crossref","unstructured":"Comer JM, Cerda JC, Martinez CD, Hoe DH (2012) Random number generators using cellular automata implemented on FPGAs. In: Proceedings of 44th southeastern symposium on system theory (SSST), 2012, pp 67\u201372","DOI":"10.1109\/SSST.2012.6195137"},{"issue":"1","key":"9696_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook M (2004) Universality in elementary cellular automata. Complex Syst 15(1):1\u201340","journal-title":"Complex Syst"},{"issue":"2","key":"9696_CR55","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R Cori","year":"1993","unstructured":"Cori R, Metivier Y, Zielonka W (1993) Asynchronous mappings and asynchronous cellular automata. Inf Comput 106(2):159\u2013202","journal-title":"Inf Comput"},{"issue":"6","key":"9696_CR56","first-page":"1035","volume":"1","author":"K Culik","year":"1987","unstructured":"Culik K (1987) On invertible cellular automata. Complex Syst 1(6):1035\u20131044","journal-title":"Complex Syst"},{"key":"9696_CR57","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(91)90267-6","volume":"91","author":"K Culik","year":"1991","unstructured":"Culik K, Dube S (1991) An efficient solution to the firing mob problem. Theor Comput Sci 91:57\u201369","journal-title":"Theor Comput Sci"},{"key":"9696_CR58","first-page":"177","volume":"2","author":"K Culik","year":"1988","unstructured":"Culik K, Yu S (1988) Undecidability of cellular automata classification schemes. Complex Syst 2:177\u2013190","journal-title":"Complex Syst"},{"issue":"1\u20133","key":"9696_CR59","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0167-2789(90)90194-T","volume":"45","author":"K Culik","year":"1990","unstructured":"Culik K, Hard LP, Yu S (1990) Computation theoretic aspects of cellular automata. Physica D 45(1\u20133):357\u2013378","journal-title":"Physica D"},{"key":"9696_CR60","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0219525907001124","volume":"10","author":"C Darabos","year":"2007","unstructured":"Darabos C, Giacobini M, Tomassini M (2007) Performance and robustness of cellular automata computation on irregular networks. Adv Complex Syst 10:85\u2013110","journal-title":"Adv Complex Syst"},{"key":"9696_CR61","unstructured":"Das AK (1990) Additive cellular automata: theory and application as a built-in self-test structure. Ph.D. thesis, IIT, Kharagpur"},{"key":"9696_CR62","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0165-6074(89)90254-8","volume":"26","author":"AK Das","year":"1989","unstructured":"Das AK, Chaudhuri PP (1989) An efficient on-chip deterministic test pattern generation scheme. Microprocess Microprogr 26:195\u2013204","journal-title":"Microprocess Microprogr"},{"issue":"3","key":"9696_CR63","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/12.210176","volume":"42","author":"AK Das","year":"1993","unstructured":"Das AK, Chaudhuri PP (1993) Vector space theoretic analysis of additive cellular automata and its applications for pseudo-exhaustive test pattern generation. IEEE Trans Comput 42(3):340\u2013352","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"9696_CR64","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1049\/ip-e.1990.0008","volume":"137","author":"AK Das","year":"1990","unstructured":"Das AK, Ganguly A, Dasgupta A, Bhawmik S, Chaudhuri PP (1990a) Efficient characterisation of cellular automata. IEE Proc E Comput Digit Tech 137(1):81\u201387","journal-title":"IEE Proc E Comput Digit Tech"},{"key":"9696_CR65","doi-asserted-by":"crossref","unstructured":"Das AK, Saha D, Chowdhury AR, Misra S, Chaudhuri PP (1990b) Signature analyzer based on additive cellular automata. In: Proceedings of 20th fault tolerant computing systems, pp 265\u2013272","DOI":"10.1109\/FTCS.1990.89374"},{"issue":"3","key":"9696_CR66","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0020-0255(92)90053-B","volume":"61","author":"AK Das","year":"1992","unstructured":"Das AK, Sanyal A, Chaudhuri PP (1992) On characterization of cellular automata with matrix algebra. Inf Sci 61(3):251\u2013277","journal-title":"Inf Sci"},{"key":"9696_CR67","unstructured":"Das S (2007) Theory and applications of nonlinear cellular automata in VLSI design. Ph.D. thesis, Bengal Engineering and Science University, Shibpur"},{"key":"9696_CR68","unstructured":"Das S (2011) Characterization of non-uniform number conserving cellular automata. In: Proceedings of international workshop on cellular automata and discrete complex systems, AUTOMATA 2011, Chile, pp 17\u201328"},{"issue":"6","key":"9696_CR69","first-page":"439","volume":"6","author":"S Das","year":"2011","unstructured":"Das S, Chowdhury DR (2011) Cryptographically suitable maximum length cellular automata. J Cell Autom 6(6):439\u2013459","journal-title":"J Cell Autom"},{"issue":"2","key":"9696_CR70","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s12095-012-0079-1","volume":"5","author":"S Das","year":"2013","unstructured":"Das S, Chowdhury DR (2013) CAR30: a new scalable stream cipher with rule 30. Cryptogr Commun 5(2):137\u2013162","journal-title":"Cryptogr Commun"},{"key":"9696_CR71","doi-asserted-by":"crossref","unstructured":"Das S, Sikdar BK (2008) Characterization of non-reachable states in irreversible ca state space. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2008, Japan. Springer, Berlin, pp 160\u2013167","DOI":"10.1007\/978-3-540-79992-4_21"},{"key":"9696_CR72","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.entcs.2009.09.022","volume":"252","author":"S Das","year":"2009","unstructured":"Das S, Sikdar BK (2009) Characterization of 1-D periodic boundary reversible ca. Electron Notes Theor Comput Sci 252:205\u2013227","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"1","key":"9696_CR73","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TCAD.2009.2034349","volume":"29","author":"S Das","year":"2010","unstructured":"Das S, Sikdar BK (2010) A scalable test structure for multicore chip. IEEE Trans CAD Integr Circuits Syst 29(1):127\u2013137","journal-title":"IEEE Trans CAD Integr Circuits Syst"},{"key":"9696_CR74","doi-asserted-by":"crossref","unstructured":"Das S, Ganguly N, Sikdar BK, Chaudhuri PP (2003a) Design of a universal BIST (UBIST) structure. In: Proceedings of 16th international conference on VLSI design, pp 161\u2013166","DOI":"10.1109\/ICVD.2003.1183131"},{"key":"9696_CR75","doi-asserted-by":"crossref","unstructured":"Das S, Kundu A, Sen S, Sikdar BK, Chaudhuri PP (2003b) Non-linear celluar automata based PRPG design (without prohibited pattern set) in linear time complexity. In: Proceedings of Asian test symposium, pp 78\u201383","DOI":"10.1109\/ATS.2003.1250787"},{"key":"9696_CR76","first-page":"813","volume-title":"Lecture Notes in Computer Science","author":"Sukanta Das","year":"2004","unstructured":"Das S, Sikdar BK, Chaudhuri PP (2004) Characterization of reachable\/nonreachable cellular automata states. In: Proceedings of internationl conference on cellular automata, research and industry, ACRI 2004, Netherlands. Springer, Berlin, pp 813\u2013822"},{"key":"9696_CR77","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.entcs.2009.09.021","volume":"252","author":"S Das","year":"2009","unstructured":"Das S, Mukherjee S, Naskar N, Sikdar BK (2009) Characterization of single cycle ca and its application in pattern classification. Electron Notes Theor Comput Sci 252:181\u2013203","journal-title":"Electron Notes Theor Comput Sci"},{"key":"9696_CR78","first-page":"643","volume-title":"Lecture Notes in Computer Science","author":"Sukanta Das","year":"2012","unstructured":"Das S, Sarkar A, Sikdar BK (2012) Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2012, Greece. Springer, Berlin, pp 643\u2013652"},{"issue":"2","key":"9696_CR79","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00330-2","volume":"218","author":"M Delorme","year":"1999","unstructured":"Delorme M, Mazoyer J, Tougne L (1999) Discrete parabolas and circles on 2D cellular automata. Theor Comput Sci 218(2):347\u2013417","journal-title":"Theor Comput Sci"},{"issue":"47","key":"9696_CR80","doi-asserted-by":"publisher","first-page":"4823","DOI":"10.1016\/j.tcs.2009.06.023","volume":"410","author":"A Dennunzio","year":"2009","unstructured":"Dennunzio A, Lena PD, Formenti E, Margara L (2009) On the directional dynamics of additive cellular automata. Theor Comput Sci 410(47):4823\u20134833","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9696_CR81","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/FI-2012-755","volume":"120","author":"A Dennunzio","year":"2012","unstructured":"Dennunzio A, Formenti E, Manzoni L (2012a) Computing issues of asynchronous CA. Fundam Inf 120(2):165\u2013180","journal-title":"Fundam Inf"},{"key":"9696_CR82","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ic.2012.02.008","volume":"215","author":"A Dennunzio","year":"2012","unstructured":"Dennunzio A, Formenti E, Provillard J (2012b) Non-uniform cellular automata: classes, dynamics, and decidability. Inf Comput 215:32\u201346","journal-title":"Inf Comput"},{"issue":"2\u20133","key":"9696_CR501","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3233\/FI-2013-877","volume":"126","author":"A Dennunzio","year":"2013","unstructured":"Dennunzio A, Di Lena P, Formenti E, Margara L (2013a) Periodic orbits and dynamical complexity in cellular automata. Fundam Inform 126(2\u20133):183\u2013199","journal-title":"Fundam Informaticae"},{"issue":"4","key":"9696_CR83","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-013-9386-5","volume":"12","author":"A Dennunzio","year":"2013","unstructured":"Dennunzio A, Formenti E, Manzoni L, Mauri G (2013b) m-asynchronous cellular automata: from fairness to quasi-fairness. Nat Comput 12(4):561\u2013572","journal-title":"Nat Comput"},{"key":"9696_CR84","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2012.05.013","volume":"504","author":"A Dennunzio","year":"2013","unstructured":"Dennunzio A, Formenti E, Provillard J (2013c) Local rule distributions, language complexity and non-uniform cellular automata. Theor Comput Sci 504:38\u201351","journal-title":"Theor Comput Sci"},{"key":"9696_CR85","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2014.06.046","volume":"559","author":"A Dennunzio","year":"2014","unstructured":"Dennunzio A, Formenti E, Provillard J (2014a) Three research directions in non-uniform cellular automata. Theor Comput Sci 559:73\u201390","journal-title":"Theor Comput Sci"},{"key":"9696_CR86","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2013.11.005","volume":"516","author":"A Dennunzio","year":"2014","unstructured":"Dennunzio A, Formenti E, Weiss M (2014b) Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues. Theor Comput Sci 516:40\u201359","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9696_CR228","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physd.2006.02.010","volume":"217","author":"GMB de Oliveira","year":"2006","unstructured":"de Oliveira GMB, Siqueira SRC (2006) Parameter characterization of two-dimensional cellular automata rule space. Physica D 217(1):1\u20136","journal-title":"Physica D"},{"key":"9696_CR229","doi-asserted-by":"crossref","unstructured":"de\u00a0Oliveira PPB (2013) Conceptual connections around density determination in cellular automata. In: Proceedings of international workshop on cellular automata and discrete complex systems, AUTOMATA 2013, Germany, pp 1\u201314","DOI":"10.1007\/978-3-642-40867-0_1"},{"key":"9696_CR87","volume-title":"An introduction to chaotic dynamical systems","author":"RL Devaney","year":"1986","unstructured":"Devaney RL (1986) An introduction to chaotic dynamical systems. Addison Wesley, Boston"},{"issue":"3","key":"9696_CR88","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0022-0000(75)80059-6","volume":"11","author":"S Di Gregorio","year":"1975","unstructured":"Di Gregorio S, Trautteur G (1975) On reversibility in cellular automata. J Comput Syst Sci 11(3):382\u2013391","journal-title":"J Comput Syst Sci"},{"key":"9696_CR89","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718492","volume-title":"Algebraic theory of automata networks: an introduction","author":"P Domosi","year":"2005","unstructured":"Domosi P, Nehaniv CL (2005) Algebraic theory of automata networks: an introduction. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"1\u20132","key":"9696_CR90","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M Droste","year":"2000","unstructured":"Droste M, Gastin P, Kuske D (2000) Asynchronous cellular automata for pomsets. Theor Comput Sci 247(1\u20132):1\u201338","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9696_CR91","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S0129054195000202","volume":"6","author":"JC Dubacq","year":"1995","unstructured":"Dubacq JC (1995) How to simulate turing machines by invertible one-dimensional cellular automata. Int J Found Comput Sci 6(4):395\u2013402","journal-title":"Int J Found Comput Sci"},{"key":"9696_CR92","first-page":"433","volume-title":"Lecture Notes in Computer Science","author":"Bruno Durand","year":"1993","unstructured":"Durand B (1993) Global properties of 2d cellular automata: Some complexity results. In: Proceedings of 18th international symposium, MFCS\u201993, Poland. Springer, Berlin, pp 433\u2013441"},{"issue":"1\u20133","key":"9696_CR93","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0304-3975(02)00534-0","volume":"299","author":"B Durand","year":"2003","unstructured":"Durand B, Formenti E, R\u00f3ka Z (2003a) Number-conserving cellular automata i: decidability. Theor Comput Sci 299(1\u20133):523\u2013535","journal-title":"Theor Comput Sci"},{"key":"9696_CR94","first-page":"117","volume":"3","author":"B Durand","year":"2003","unstructured":"Durand B, Formenti E, Varouchas G (2003b) On undecidability of equicontinuity classification for cellular automata. Discrete Math Theor Comput Sci 3:117\u2013128","journal-title":"Discrete Math Theor Comput Sci"},{"key":"9696_CR95","unstructured":"Durand-Lose JO (1998) About the universality of the billiard ball model. In: Proceedings international colloquium universal machines and computations, MCU\u201998, France, pp 118\u2013132"},{"key":"9696_CR96","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C Dyer","year":"1980","unstructured":"Dyer C (1980) One-way bounded cellular automata. Inf Control 44:261\u2013281","journal-title":"Inf Control"},{"issue":"1","key":"9696_CR97","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/jtbi.1993.1007","volume":"160","author":"GB Ermentrout","year":"1993","unstructured":"Ermentrout GB, Edelstein-Keshet L (1993) Cellular automata approaches to biological modeling. J Theor Biol 160(1):97\u2013133","journal-title":"J Theor Biol"},{"issue":"2","key":"9696_CR98","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 (2013) Stochastic cellular automata solutions to the density classification problem\u2014when randomness helps computing. Theory Comput Syst 53(2):223\u2013242","journal-title":"Theory Comput Syst"},{"issue":"5\u20136","key":"9696_CR99","first-page":"387","volume":"9","author":"N Fat\u00e8s","year":"2014","unstructured":"Fat\u00e8s N (2014) Guided tour of asynchronous cellular automata. J Cell Autom 9(5\u20136):387\u2013416","journal-title":"J Cell Autom"},{"key":"9696_CR100","unstructured":"Fat\u00e9s N (2017) FiatLux: cellular automata and discrete complex systems simulator. http:\/\/fiatlux.loria.fr\/ . Accessed Aug 25, 2017"},{"issue":"1\u20133","key":"9696_CR101","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2006.05.036","volume":"362","author":"N Fat\u00e8s","year":"2006","unstructured":"Fat\u00e8s N, Thierry E, Morvan M, Schabanel N (2006) Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor Comput Sci 362(1\u20133):1\u201316","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9696_CR102","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jcom.1998.0474","volume":"14","author":"M Finelli","year":"1998","unstructured":"Finelli M, Manzini G, Margara L (1998) Lyapunov exponents versus expansivity and sensitivity in cellular automata. J Complex 14(2):210\u2013233","journal-title":"J Complex"},{"key":"9696_CR103","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"PC Fischer","year":"1965","unstructured":"Fischer PC (1965) Generation of primes by a one-dimensional real-time iterative array. J ACM 12:388\u2013394","journal-title":"J ACM"},{"key":"9696_CR104","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(03)00134-8","volume":"304","author":"E Formenti","year":"2003","unstructured":"Formenti E, Grange A (2003) Number conserving cellular automata ii: dynamics. Theor Comput Sci 304:269\u2013290","journal-title":"Theor Comput Sci"},{"key":"9696_CR105","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-13350-8_5","volume-title":"Computing with new resources: essays dedicated to jozef gruska on the occasion of his 80th birthday","author":"E Formenti","year":"2014","unstructured":"Formenti E, Imai K, Martin B, Yun\u00e8s JB (2014) Advances on random sequence generation by uniform cellular automata. In: Calude CS, Freivalds R, Kazuo I (eds) Computing with new resources: essays dedicated to jozef gruska on the occasion of his 80th birthday. Springer, Cham, pp 56\u201370"},{"key":"9696_CR106","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219\u2013253","journal-title":"Int J Theor Phys"},{"issue":"14","key":"9696_CR107","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1103\/PhysRevLett.56.1505","volume":"56","author":"U Frisch","year":"1986","unstructured":"Frisch U, Hasslacher B, Pomeau Y (1986) Lattice gas automata for the Navier\u2013Stokes equation. Phys Rev Lett 56(14):1505\u20131508","journal-title":"Phys Rev Lett"},{"key":"9696_CR108","doi-asserted-by":"publisher","first-page":"R2081","DOI":"10.1103\/PhysRevE.55.R2081","volume":"55","author":"H Fuk\u015b","year":"1997","unstructured":"Fuk\u015b H (1997) Solution of the density classification problem with two cellular automata rules. Phys Rev E 55:R2081\u2013R2084","journal-title":"Phys Rev E"},{"issue":"1","key":"9696_CR109","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1088\/0951-7715\/17\/1\/010","volume":"17","author":"H Fuk\u015b","year":"2004","unstructured":"Fuk\u015b H (2004) Probabilistic cellular automata with conserved quantities. Nonlinearity 17(1):159","journal-title":"Nonlinearity"},{"issue":"5","key":"9696_CR110","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1016\/S1359-6454(96)00303-5","volume":"45","author":"CA Gandin","year":"1997","unstructured":"Gandin CA, Rappaz M (1997) A 3D cellular automaton algorithm for the prediction of dendritic grain growth. Acta Mater 45(5):2187\u20132195","journal-title":"Acta Mater"},{"key":"9696_CR111","unstructured":"Ganguly N, Halder D, Deb J, Sikdar BK, Chaudhuri PP (2000) Hashing through cellular automata. In: Proceedings of 8th international conference of advance computing and communication, pp 95\u2013101"},{"key":"9696_CR112","first-page":"56","volume-title":"Lecture Notes in Computer Science","author":"Niloy Ganguly","year":"2002","unstructured":"Ganguly N, Maji P, Dhar S, Sikdar BK, Chaudhuri PP (2002a) Evolving cellular automata as pattern classifier. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2002, Switzerland. Springer, Berlin, pp 56\u201368"},{"issue":"7","key":"9696_CR113","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1142\/S0218001402001988","volume":"16","author":"N Ganguly","year":"2002","unstructured":"Ganguly N, Maji P, Sikdar BK, Chaudhuri PP (2002b) Generalized multiple attractor cellular automata (GMACA) For associative memory. Int J of Pattern Recognit Artif Intell 16(7):781\u2013795 (Special Issue: Computational Intelligence for Pattern Recognition)","journal-title":"Int J of Pattern Recognit Artif Intell"},{"key":"9696_CR114","doi-asserted-by":"crossref","unstructured":"Ganguly N, Sikdar BK, Chaudhuri PP (2002c) Design of an on-chip test pattern generator without prohibitited pattern set (PPS). In: Proceedings of ASP-DAC\/VLSI design 2002, India, pp 689\u2013694","DOI":"10.1109\/ASPDAC.2002.995015"},{"issue":"2","key":"9696_CR115","first-page":"137","volume":"87","author":"N Ganguly","year":"2008","unstructured":"Ganguly N, Sikdar BK, Chaudhuri PP (2008) Exploring cycle structures of additive cellular automata. Fundam Inf 87(2):137\u2013154","journal-title":"Fundam Inf"},{"issue":"2","key":"9696_CR116","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1038\/scientificamerican0271-112","volume":"224","author":"M Gardner","year":"1971","unstructured":"Gardner M (1971) On cellular automata self-reproduction, the garden of eden and the game of \u2018Life\u2019. Sci Am 224(2):112\u2013118","journal-title":"Sci Am"},{"key":"9696_CR117","unstructured":"Ghosh S, Laskar N, Mahapatra S, Chaudhuri PP (2007) Probabilistic cellular automata model for identification of cpg island in DNA string. In: Proceedings of Indian international conference on artificial intelligence (IICAI), pp 1490\u20131509"},{"key":"9696_CR118","doi-asserted-by":"crossref","unstructured":"Ghosh S, Bachhar T, Maiti NS, Mitra I, Chaudhuri PP (2010) Theory and application of equal length cycle cellular automata (ELCCA) for enzyme classification. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2010, Italy, pp 46\u201357","DOI":"10.1007\/978-3-642-15979-4_5"},{"key":"9696_CR119","doi-asserted-by":"publisher","first-page":"47","DOI":"10.25088\/ComplexSystems.20.1.47","volume":"20","author":"S Ghosh","year":"2011","unstructured":"Ghosh S, Maiti NS, Chaudhuri PP, Sikdar BK (2011) On invertible three neighborhood null-boundary uniform cellular automata. Complex Syst 20:47\u201365","journal-title":"Complex Syst"},{"key":"9696_CR120","first-page":"360","volume-title":"Lecture Notes in Computer Science","author":"Soumyabrata Ghosh","year":"2012","unstructured":"Ghosh S, Maiti NS, Chaudhuri PP (2012) Theory and application of restricted five neighborhood cellular automata (r5nca) for protein structure prediction. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2012, Greece. Springer, Berlin, pp 360\u2013369"},{"key":"9696_CR121","doi-asserted-by":"crossref","unstructured":"Ghosh S, Maiti NS, Chaudhuri PP (2014) Cellular automata model for protein structure synthesis (PSS). In: Proceedings of international conference on cellular automata, research and industry, ACRI 2014, Poland, pp 268\u2013277","DOI":"10.1007\/978-3-319-11520-7_28"},{"issue":"29","key":"9696_CR122","doi-asserted-by":"publisher","first-page":"3616","DOI":"10.1016\/j.tcs.2011.03.008","volume":"412","author":"E Goles","year":"2011","unstructured":"Goles E, Moreira A, Rapaport I (2011) Communication complexity in number-conserving and monotone cellular automata. Theor Comput Sci 412(29):3616\u20133628","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9696_CR123","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0022-0000(78)90003-X","volume":"17","author":"U Golze","year":"1978","unstructured":"Golze U (1978) (a-)synchronous (non-)deterministic cell spaces simulating each other. J Comput Syst Sci 17(2):176\u2013193","journal-title":"J Comput Syst Sci"},{"issue":"1\u20132","key":"9696_CR124","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91195-0","volume":"53","author":"U Golze","year":"1982","unstructured":"Golze U, Priese L (1982) Petri net implementations by a universal cell space. Inf Control 53(1\u20132):121\u2013138","journal-title":"Inf Control"},{"key":"9696_CR125","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1103\/PhysRevLett.55.2527","volume":"55","author":"G Grinstein","year":"1985","unstructured":"Grinstein G, Jayaprakash C, He Y (1985) Statistical mechanics of probabilistic cellular automata. Phys Rev Lett 55:2527\u20132530","journal-title":"Phys Rev Lett"},{"issue":"7","key":"9696_CR126","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TCAD.2004.829808","volume":"23","author":"S Guan","year":"2004","unstructured":"Guan S, Tan SK (2004) Pseudorandom number generation with self-programmable cellular automata. IEEE Trans CAD 23(7):1095\u20131101","journal-title":"IEEE Trans CAD"},{"issue":"1","key":"9696_CR127","first-page":"23","volume":"7","author":"S Guan","year":"2003","unstructured":"Guan S, Zhang S (2003) An evolutionary approach to the design of controllable cellular automata structure for random number generation. IEEE Trans CAD 7(1):23\u201336","journal-title":"IEEE Trans CAD"},{"issue":"3","key":"9696_CR128","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0167-2789(91)90150-8","volume":"49","author":"T Hattori","year":"1991","unstructured":"Hattori T, Takesue S (1991) Additive conserved quantities in discrete-time lattice dynamical systems. Physica D 49(3):295\u2013322","journal-title":"Physica D"},{"key":"9696_CR129","doi-asserted-by":"publisher","first-page":"177","DOI":"10.25088\/ComplexSystems.23.2.177","volume":"23","author":"R Hazari","year":"2014","unstructured":"Hazari R, Das S (2014) Number conservation property of elementary cellular automata under asynchronous update. Complex Syst 23:177\u2013195","journal-title":"Complex Syst"},{"key":"9696_CR130","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Mathe Syst Theory 3:320\u2013375","journal-title":"Mathe Syst Theory"},{"issue":"7\/8","key":"9696_CR131","first-page":"423","volume":"18","author":"A Hemmerling","year":"1982","unstructured":"Hemmerling A (1982) On the computational equivalence of synchronous and asynchronous cellular spaces. Elektronische Informationsverarbeitung und Kybernetik 18(7\/8):423\u2013434","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"2","key":"9696_CR132","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1177\/003754977302100203","volume":"21","author":"GT Herman","year":"1973","unstructured":"Herman GT, Liu WH (1973) The daughter of celia, the french flag, and the firing squad. SIMULATION 21(2):33\u201341","journal-title":"SIMULATION"},{"issue":"10","key":"9696_CR133","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1109\/12.35843","volume":"C\u201338","author":"PD Hortensius","year":"1989","unstructured":"Hortensius PD, McLeod RD, Card HC (1989a) Parallel random number generation for VLSI systems using cellular automata. IEEE Trans Comput C\u201338(10):1466\u20131473","journal-title":"IEEE Trans Comput"},{"issue":"8","key":"9696_CR134","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/43.31545","volume":"8","author":"PD Hortensius","year":"1989","unstructured":"Hortensius PD, McLeod RD, Pries W, Miller DM, Card HC (1989b) Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Trans Comput Aided Design Integr Circuits Syst 8(8):842\u2013859","journal-title":"IEEE Trans Comput Aided Design Integr Circuits Syst"},{"issue":"10","key":"9696_CR135","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/12.59857","volume":"C\u201339","author":"PD Hortensius","year":"1990","unstructured":"Hortensius PD, McLeod RD, Card HC (1990) Cellular automata based signature analysis for built-in self-test. IEEE Trans Comput C\u201339(10):1273\u20131283","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"9696_CR136","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0304-3975(99)00099-7","volume":"231","author":"K Imai","year":"2000","unstructured":"Imai K, Morita K (2000) A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor Comput Sci 231(2):181\u2013191","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"9696_CR137","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-2789(84)90249-5","volume":"10","author":"TE Ingerson","year":"1984","unstructured":"Ingerson TE, Buvel RL (1984) Structure in asynchronous cellular automata. Physica D 10(1\u20132):59\u201368","journal-title":"Physica D"},{"issue":"1","key":"9696_CR138","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0022-0000(83)90033-8","volume":"27","author":"M It\u00f4","year":"1983","unstructured":"It\u00f4 M, \u00d4sato N, Nasu M (1983) Linear cellular automata over $${{\\mathbb{Z}}}_m$$. J Comput Syst Sci 27(1):125\u2013140","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"9696_CR139","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01010580","volume":"43","author":"E Jen","year":"1986","unstructured":"Jen E (1986) Invariant strings and pattern-recognizing properties of one-dimensional cellular automata. J Stat Phys 43(1):243\u2013265","journal-title":"J Stat Phys"},{"issue":"3","key":"9696_CR140","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.optlastec.2011.08.023","volume":"44","author":"J Jin","year":"2012","unstructured":"Jin J, Wu ZH (2012) A secret image sharing based on neighborhood configurations of 2-D cellular automata. Optics Laser Technol 44(3):538\u2013548","journal-title":"Optics Laser Technol"},{"key":"9696_CR141","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0019-9958(74)80024-0","volume":"24","author":"JR Jump","year":"1974","unstructured":"Jump JR, Kirtane JS (1974) On the interconnection structure of cellular automata networks. Inf Control 24:74\u201391","journal-title":"Inf Control"},{"key":"9696_CR142","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/0167-2789(90)90195-U","volume":"45","author":"J Kari","year":"1990","unstructured":"Kari J (1990) Reversibility of 2D cellular automata is undecidable. Physica D 45:386\u2013395","journal-title":"Physica D"},{"issue":"3","key":"9696_CR143","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0221036","volume":"21","author":"J Kari","year":"1992","unstructured":"Kari J (1992) The nilpotency problem of one-dimensional cellular automata. SIAM J Comput 21(3):571\u2013586","journal-title":"SIAM J Comput"},{"issue":"1","key":"9696_CR144","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J Kari","year":"1994","unstructured":"Kari J (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48(1):149\u2013182","journal-title":"J Comput Syst Sci"},{"key":"9696_CR145","first-page":"57","volume-title":"Reversible cellular automata","author":"J Kari","year":"2005","unstructured":"Kari J (2005a) Reversible cellular automata. Springer, Berlin, pp 57\u201368"},{"issue":"1\u20133","key":"9696_CR146","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 (2005b) Theory of cellular automata: a survey. Theor Comput Sci 334(1\u20133):3\u201333","journal-title":"Theor Comput Sci"},{"issue":"1\u20134","key":"9696_CR147","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3233\/FI-2012-675","volume":"116","author":"J Kari","year":"2012","unstructured":"Kari J, Le Gloannec B (2012) Modified traffic cellular automaton for the density classification task. Fundam Inf 116(1\u20134):141\u2013156","journal-title":"Fundam Inf"},{"key":"9696_CR148","first-page":"224","volume-title":"Lecture Notes in Computer Science","author":"Yoshihiko Kayama","year":"2012","unstructured":"Kayama Y (2012) Network view of binary cellular automata. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2012, Greece. Springer, Berlin, pp 224\u2013233"},{"issue":"3","key":"9696_CR149","first-page":"233","volume":"1","author":"Y Kayama","year":"2011","unstructured":"Kayama Y, Imamura Y (2011) Network representation of the game of life. J Artif Intell Soft Comput Res 1(3):233\u2013240","journal-title":"J Artif Intell Soft Comput Res"},{"issue":"10","key":"9696_CR150","first-page":"33","volume":"5","author":"O Kazar","year":"2011","unstructured":"Kazar O, Slatnia S (2011) Evolutionary cellular automata for image segmentation and noise filtering using genetic algorithms. J Appl Comput Sci Math 5(10):33\u201340","journal-title":"J Appl Comput Sci Math"},{"issue":"C","key":"9696_CR151","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.physa.2003.10.017","volume":"333","author":"BS Kerner","year":"2004","unstructured":"Kerner BS (2004) Three-phase traffic theory and highway capacity. Physica A 333(C):379\u2013440","journal-title":"Physica A"},{"key":"9696_CR152","unstructured":"Khan AR (1998) Replacement of some graphics routines with the help of 2D cellular automata algorithms for faster graphics operations. Ph.D. thesis, University of Kashmir"},{"issue":"1","key":"9696_CR153","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1143\/PTP.81.47","volume":"81","author":"T Kohyama","year":"1989","unstructured":"Kohyama T (1989) Cellular automata with particle conservation. Progress Theoret Phys 81(1):47\u201359","journal-title":"Progress Theoret Phys"},{"issue":"3\u20134","key":"9696_CR154","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BF01029203","volume":"63","author":"T Kohyama","year":"1991","unstructured":"Kohyama T (1991) Cluster growth in particle-conserving cellular automata. J Stat Phys 63(3\u20134):637\u2013651","journal-title":"J Stat Phys"},{"issue":"02","key":"9696_CR155","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S014338579706985X","volume":"17","author":"P Kurka","year":"1997","unstructured":"Kurka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theory Dyn Syst 17(02):417\u2013433","journal-title":"Ergod Theory Dyn Syst"},{"issue":"2003","key":"9696_CR156","first-page":"203","volume":"58","author":"P Kurka","year":"2003","unstructured":"Kurka P (2003) Cellular automata with vanishing particles. Fundam Inf 58(2003):203\u2013221","journal-title":"Fundam Inf"},{"issue":"6","key":"9696_CR157","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/S0952-1976(97)00040-7","volume":"10","author":"O Lafe","year":"1997","unstructured":"Lafe O (1997) Data compression and encryption using cellular automata transforms. Eng Appl Artif Intell 10(6):581\u2013591","journal-title":"Eng Appl Artif Intell"},{"key":"9696_CR158","unstructured":"Lafe OE (2002) Method and apparatus for video compression using sequential frame cellular automata transforms. US Patent 6,456,744"},{"key":"9696_CR159","doi-asserted-by":"publisher","first-page":"5148","DOI":"10.1103\/PhysRevLett.74.5148","volume":"74","author":"M Land","year":"1995","unstructured":"Land M, Belew RK (1995) No perfect two-state cellular automata for density classification exists. Phys Rev Lett 74:5148\u20135150","journal-title":"Phys Rev Lett"},{"key":"9696_CR160","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0167-2789(90)90064-V","volume":"42","author":"CG Langton","year":"1990","unstructured":"Langton CG (1990) Computation at the edge of chaos. Physica D 42:12\u201337","journal-title":"Physica D"},{"issue":"2","key":"9696_CR161","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/0378-4371(89)90061-7","volume":"157","author":"G Le Ca\u00ebr","year":"1989","unstructured":"Le Ca\u00ebr G (1989) Comparison between simultaneous and sequential updating in $$2^{n+1}-1$$ cellular automata. Physica A 157(2):669\u2013687","journal-title":"Physica A"},{"issue":"2","key":"9696_CR162","first-page":"173","volume":"5","author":"T Legendi","year":"1981","unstructured":"Legendi T, Katona E (1981) A 5 state solution of the early bird problem in a one dimensional cellular space. Acta Cybern 5(2):173\u2013179","journal-title":"Acta Cybern"},{"issue":"1","key":"9696_CR163","first-page":"81","volume":"7","author":"T Legendi","year":"1986","unstructured":"Legendi T, Katona E (1986) A solution of the early bird problem in an n-dimensional cellular space. Acta Cybern 7(1):81\u201387","journal-title":"Acta Cybern"},{"key":"9696_CR164","first-page":"437","volume":"9","author":"A Leporati","year":"2014","unstructured":"Leporati A, Mariot L (2014) Cryptographic properties of bipermutive cellular automata rules. J Cell Autom 9:437\u2013475","journal-title":"J Cell Autom"},{"key":"9696_CR165","unstructured":"Li J, Demaine E, Gymrek M (2010) Es.268 the mathematics in toys and games, spring 2010. (massachusetts institute of technology: Mit opencourseware). http:\/\/ocw.mit.edu . Accessed"},{"key":"9696_CR166","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0167-2789(90)90175-O","volume":"45","author":"W Li","year":"1990","unstructured":"Li W, Packard NH, Langton CG (1990) Transition phenomena in cellular automata rule space. Physica D 45:77\u201394","journal-title":"Physica D"},{"issue":"3","key":"9696_CR167","first-page":"299","volume":"4","author":"K Lindgren","year":"1990","unstructured":"Lindgren K, Nordahl MG (1990) Universal computation in simple one-dimensional cellular automata. Complex Syst 4(3):299\u2013318","journal-title":"Complex Syst"},{"issue":"1","key":"9696_CR168","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/0406004","volume":"6","author":"A Mach\u00ec","year":"1993","unstructured":"Mach\u00ec A, Mignosi F (1993) Garden of eden configurations for cellular automata on cayley graphs of groups. SIAM J Discrete Math 6(1):44\u201356","journal-title":"SIAM J Discrete Math"},{"key":"#cr-split#-9696_CR169.1","unstructured":"Maiti NS, Munshi S, Chaudhuri PP (2006) An analytical formulation for cellular automata"},{"key":"#cr-split#-9696_CR169.2","unstructured":"(CA) based solution of density classification task (DCT). In: Proceedings of international conference on cellular automata, research and industry, ACRI 2006. Springer, pp 147-156"},{"issue":"1","key":"9696_CR170","doi-asserted-by":"publisher","first-page":"89","DOI":"10.25088\/ComplexSystems.19.1.89","volume":"19","author":"NS Maiti","year":"2010","unstructured":"Maiti NS, Ghosh S, Munshi S, Chaudhuri PP (2010) Linear time algorithm for identifying the invertibility of null-boundary three neighborhood cellular automata. Complex Syst 19(1):89\u2013113","journal-title":"Complex Syst"},{"key":"9696_CR171","unstructured":"Maji P (2005) Cellular automata evolution for pattern recognition. Ph.D. thesis, Jadavpur University, Kolkata"},{"key":"9696_CR172","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-24571-1_46","volume-title":"Database Systems for Advanced Applications","author":"Pradipta Maji","year":"2004","unstructured":"Maji P, Chaudhuri PP (2004) Fmaca: A fuzzy cellular automata based pattern classifier. In: Proceedings of 9th international conference on database systems for advanced applications, DASFAA 2004. Springer, Berlin, pp 494\u2013505"},{"issue":"4","key":"9696_CR173","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1093\/ietisy\/e88-d.4.691","volume":"E88\u2013D","author":"P Maji","year":"2005","unstructured":"Maji P, Chaudhuri PP (2005) Fuzzy cellular automata for modeling pattern classifier. IEICE Trans Inf Syst E88\u2013D(4):691\u2013702","journal-title":"IEICE Trans Inf Syst"},{"issue":"4","key":"9696_CR174","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1109\/TSMCA.2003.817035","volume":"33","author":"P Maji","year":"2003","unstructured":"Maji P, Ganguly N, Chaudhuri PP (2003a) Error correcting capability of cellular automata based associative memory. IEEE Trans Syst Man Cybern A 33(4):466\u2013480","journal-title":"IEEE Trans Syst Man Cybern A"},{"issue":"3","key":"9696_CR175","first-page":"321","volume":"58","author":"P Maji","year":"2003","unstructured":"Maji P, Shaw C, Ganguly N, Sikdar BK, Chaudhuri PP (2003b) Theory and application of cellular automata for pattern classification. Fundam Inf Cell Autom 58(3):321\u2013354 (special issue)","journal-title":"Fundam Inf Cell Autom"},{"key":"9696_CR176","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TC.1977.1674879","volume":"C\u201326","author":"FB Manning","year":"1977","unstructured":"Manning FB (1977) An approach to highly integrated, computer-maintained cellular arrays. IEEE Trans Comput C\u201326:536\u2013552","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"9696_CR177","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11047-012-9308-y","volume":"11","author":"L Manzoni","year":"2012","unstructured":"Manzoni L (2012) Asynchronous cellular automata and dynamical properties. Nat Comput 11(2):269\u2013276","journal-title":"Nat Comput"},{"key":"9696_CR178","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2014.08.011","volume":"559","author":"L Manzoni","year":"2014","unstructured":"Manzoni L, Umeo H (2014) The firing squad synchronization problem on ca with multiple updating cycles. Theor Comput Sci 559:108\u2013117 (non-uniform Cellular Automata)","journal-title":"Theor Comput Sci"},{"key":"9696_CR179","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2009.09.016","volume":"252","author":"M Margenstern","year":"2009","unstructured":"Margenstern M (2009) About the garden of eden theorems for cellular automata in the hyperbolic plane. Electron Notes Theor Comput Sci 252:93\u2013102","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"9","key":"9696_CR180","first-page":"563","volume":"5","author":"M Margenstern","year":"1999","unstructured":"Margenstern M, Morita K (1999) A polynomial solution for 3-sat in the space of cellular automata in the hyperbolic plane. J Univ Comput Sci 5(9):563\u2013573","journal-title":"J Univ Comput Sci"},{"issue":"1\u20132","key":"9696_CR181","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(99)00328-X","volume":"259","author":"M Margenstern","year":"2001","unstructured":"Margenstern M, Morita K (2001) Np problems are tractable in the space of cellular automata in the hyperbolic plane. Theor Comput Sci 259(1\u20132):99\u2013128","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"9696_CR182","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0167-2789(84)90252-5","volume":"10","author":"N Margolus","year":"1984","unstructured":"Margolus N (1984) Physics-like models of computation. Physica D 10(1\u20132):81\u201395","journal-title":"Physica D"},{"key":"9696_CR183","first-page":"176","volume-title":"Lecture Notes in Computer Science","author":"Luca Mariot","year":"2016","unstructured":"Mariot L (2016) Asynchrony immune cellular automata. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2016, Morocco. Springer, Cham, pp 176\u2013181"},{"issue":"3","key":"9696_CR184","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11047-016-9586-x","volume":"16","author":"L Mariot","year":"2017","unstructured":"Mariot L, Leporati A, Dennunzio A, Formenti E (2017) Computing the periods of preimages in surjective cellular automata. Nat Comput 16(3):367\u2013381","journal-title":"Nat Comput"},{"issue":"5","key":"9696_CR185","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.physleta.2008.12.013","volume":"373","author":"C Marr","year":"2009","unstructured":"Marr C, H\u00fctt MT (2009) Outer-totalistic cellular automata on graphs. Phys Lett A 373(5):546\u2013549","journal-title":"Phys Lett A"},{"issue":"2","key":"9696_CR186","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(92)00076-4","volume":"123","author":"B Martin","year":"1994","unstructured":"Martin B (1994) A universal cellular automata in quasi-linear time and its s-m-n form. Theor Comput Sci 123(2):199\u2013237","journal-title":"Theor Comput Sci"},{"key":"9696_CR187","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01223745","volume":"93","author":"O Martin","year":"1984","unstructured":"Martin O, Odlyzko AM, Wolfram S (1984) Algebraic properties of cellular automata. Commun Math Phys 93:219\u2013258","journal-title":"Commun Math Phys"},{"issue":"3","key":"9696_CR188","first-page":"231","volume":"3","author":"GJ Martinez","year":"2008","unstructured":"Martinez GJ, McIntosh HV, Mora JCST, Vergara SVC (2008) Determining a regular language by glider-based structures called phases $$f_{i}\\_1$$ in rule 110. J Cell Autom 3(3):231\u2013270 (special issues)","journal-title":"J Cell Autom"},{"issue":"2","key":"9696_CR189","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S0019-9958(76)90195-9","volume":"32","author":"A Maruoka","year":"1976","unstructured":"Maruoka A, Kimura M (1976) Condition for injectivity of global maps for tessellation automata. Inf Control 32(2):158\u2013162","journal-title":"Inf Control"},{"issue":"1","key":"9696_CR190","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0022-0000(79)90051-5","volume":"18","author":"A Maruoka","year":"1979","unstructured":"Maruoka A, Kimura M (1979) Injectivity and surjectivity of parallel maps for cellular automata. J Comput Syst Sci 18(1):47\u201364","journal-title":"J Comput Syst Sci"},{"key":"9696_CR191","doi-asserted-by":"publisher","first-page":"088,701(1\u20134)","DOI":"10.1103\/PhysRevLett.90.088701","volume":"90","author":"J Matsukidaira","year":"2003","unstructured":"Matsukidaira J, Nishinari K (2003) Euler\u2013Lagrange correspondence of cellular automaton for traffic-flow models. Phys Rev Lett 90:088,701(1\u20134)","journal-title":"Phys Rev Lett"},{"key":"9696_CR192","unstructured":"Mazoyer J, Nichitiu C, R\u00e9mila E (1999) Compass permits leader election. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, society for industrial and applied mathematics, SODA\u201999, pp 947\u2013948"},{"issue":"4","key":"9696_CR193","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"WS McCulloch","year":"1943","unstructured":"McCulloch WS, Pitts W (1943) A logical calculus of the ideas immanent in nervous activity. Bull Math Biophys 5(4):115\u2013133","journal-title":"Bull Math Biophys"},{"key":"9696_CR194","unstructured":"Miller DB, Fredkin E (2005) Two-state, reversible, universal cellular automata in three dimensions. In: Proceedings of the 2nd conference on computing frontiers. ACM, pp 45\u201351"},{"key":"9696_CR195","doi-asserted-by":"crossref","unstructured":"Misra S, Mitra B, Chaudhuri PP (1992) Synthesis of self-testable sequential logic using programmable cellular automata. In: Proceedings of international conference on VLSI design, pp 193\u2013198","DOI":"10.1109\/ICVD.1992.658046"},{"key":"9696_CR196","first-page":"89","volume":"7","author":"M Mitchell","year":"1993","unstructured":"Mitchell M, Hraber PT, Crutchfield JP (1993) Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Syst 7:89\u2013130","journal-title":"Complex Syst"},{"key":"9696_CR197","doi-asserted-by":"crossref","unstructured":"Mitra B, Panda PR, Chaudhuri PP (1991) A flexible scheme for state assignment based on characteristics of the FSM. In: Proceedings of international conference on computer aided design, ICCAD, California, pp 226\u2013229","DOI":"10.1109\/ICCAD.1991.185238"},{"key":"9696_CR198","unstructured":"Mitra S, Das S, Chaudhuri PP, Nandi S (1996) Architecture of a VLSI chip for modeling amino acid sequence in proteins. In: Proceedings of 9th international conference on VLSI design, 1996, pp 316\u2013317"},{"key":"9696_CR199","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.physa.2013.12.018","volume":"399","author":"Y Mo","year":"2014","unstructured":"Mo Y, Ren B, Yang W, Shuai J (2014) The 3-dimensional cellular automata for hiv infection. Physica A 399:31\u201339","journal-title":"Physica A"},{"key":"9696_CR200","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1090\/psapm\/014\/9961","volume":"14","author":"EF Moore","year":"1962","unstructured":"Moore EF (1962) Machine models of self-reproduction. Proc Symp Appl Math 14:17\u201333","journal-title":"Proc Symp Appl Math"},{"issue":"1","key":"9696_CR201","first-page":"25","volume":"1","author":"JCST Mora","year":"2006","unstructured":"Mora JCST, Mart\u00ednez GJ, McIntosh HV (2006) The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single welch diagram. J Cell Autom 1(1):25\u201339","journal-title":"J Cell Autom"},{"issue":"3","key":"9696_CR202","first-page":"205","volume":"3","author":"JCST Mora","year":"2008","unstructured":"Mora JCST, Hernandez MG, Vergara SVC (2008) Pair diagram and cyclic properties characterizing the inverse of reversible automata. J Cell Autom 3(3):205\u2013218 (special Issue)","journal-title":"J Cell Autom"},{"issue":"1","key":"9696_CR203","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-2789(00)00020-8","volume":"141","author":"H Moraal","year":"2000","unstructured":"Moraal H (2000) Graph-theoretical characterization of invertible cellular automata. Physica D 141(1):1\u201318","journal-title":"Physica D"},{"key":"9696_CR204","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0167-8191(00)00078-8","volume":"27","author":"FJ Morales","year":"2001","unstructured":"Morales FJ, Crutchfield JP, Mitchell M (2001) Evolving two-dimensional cellular automata to perform density classification: a report on work in progress. Parallel Comput 27:571\u2013585","journal-title":"Parallel Comput"},{"issue":"3","key":"9696_CR205","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/S0304-3975(02)00065-8","volume":"292","author":"A Moreira","year":"2003","unstructured":"Moreira A (2003) Universality and decidability of number-conserving cellular automata. Theor Comput Sci 292(3):711\u2013721","journal-title":"Theor Comput Sci"},{"issue":"02n03","key":"9696_CR206","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0219525902000572","volume":"05","author":"J Moreira","year":"2002","unstructured":"Moreira J, Deutsch A (2002) Cellular automaton models of tumor development: a critical review. Adv Complex Syst 05(02n03):247\u2013267","journal-title":"Adv Complex Syst"},{"key":"9696_CR207","volume-title":"Application of the group method to classification","author":"JL Moreno","year":"1932","unstructured":"Moreno JL, Whitin ES, Jennings HH (1932) Application of the group method to classification. National Committee on Prisons and Prison Labor, New York (reprinted in The first book on group pyschotherapy, 3d edn, 1957, pp. 3\u2013103)"},{"issue":"1","key":"9696_CR208","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(95)00038-X","volume":"148","author":"K Morita","year":"1995","unstructured":"Morita K (1995) Reversible simulation of one-dimensional irreversible cellular automata. Theor Comput Sci 148(1):157\u2013163","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9696_CR209","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.01.041","volume":"395","author":"K Morita","year":"2008","unstructured":"Morita K (2008) Reversible computing and cellular automata\u2013a survey. Theor Comput Sci 395(1):101\u2013131","journal-title":"Theor Comput Sci"},{"key":"9696_CR210","doi-asserted-by":"crossref","unstructured":"Morita K (2016) Universality of 8-state reversible and conservative triangular partitioned cellular automata. In: International conference on cellular automata. Springer, pp 45\u201354","DOI":"10.1007\/978-3-319-44365-2_5"},{"key":"9696_CR211","first-page":"758","volume":"72","author":"K Morita","year":"1989","unstructured":"Morita K, Harao M (1989) Computation universality of one dimensional reversible injective cellular automata. IEICE Trans E 72:758\u2013762","journal-title":"IEICE Trans E"},{"key":"9696_CR212","unstructured":"Morita K, Imai K (1998) Number-conserving reversible cellular automata and their computation-universality. In: Proceedings of satellite workshop on cellular automata MFCS\u201998, pp 51\u201368"},{"issue":"6","key":"9696_CR213","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1051\/ita:1999131","volume":"33","author":"K Morita","year":"1999","unstructured":"Morita K, Margenstern M, Imai K (1999) Universality of reversible hexagonal cellular automata. RAIRO Theor Inf Appl 33(6):535\u2013550","journal-title":"RAIRO Theor Inf Appl"},{"key":"9696_CR214","unstructured":"Morita K, Tojima Y, Imai K (1999) A simple computer embedded in a reversible and number conserving two-dimensional cellular space. In: Proceedings of LA Symposium\u201999, Hakone"},{"key":"9696_CR215","first-page":"685","volume":"14","author":"J Myhill","year":"1963","unstructured":"Myhill J (1963) The converse of moore\u2019s garden of eden theorem. Proc Am Math Soc 14:685\u2013686","journal-title":"Proc Am Math Soc"},{"key":"9696_CR216","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1103\/PhysRevE.53.4655","volume":"53","author":"K Nagel","year":"1996","unstructured":"Nagel K (1996) Particle hopping models and traffic flow theory. Phys Rev E 53:4655\u20134672","journal-title":"Phys Rev E"},{"issue":"12","key":"9696_CR217","first-page":"2221","volume":"2","author":"K Nagel","year":"1992","unstructured":"Nagel K, Schreckenberg M (1992) A cellular automaton model for freeway traffic. J Phys I 2(12):2221\u20132229","journal-title":"J Phys I"},{"issue":"5","key":"9696_CR218","first-page":"58","volume":"5","author":"K Nakamura","year":"1974","unstructured":"Nakamura K (1974) Asynchronous cellular automata and their computational ability. Syst Comput Controls 5(5):58\u201366","journal-title":"Syst Comput Controls"},{"issue":"1","key":"9696_CR219","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0022-0000(81)90003-9","volume":"23","author":"K Nakamura","year":"1981","unstructured":"Nakamura K (1981) Synchronous to asynchronous transformation of polyautomata. J Comput Syst Sci 23(1):22\u201337","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"9696_CR220","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/12.481481","volume":"45","author":"S Nandi","year":"1996","unstructured":"Nandi S, Chaudhuri PP (1996) Analysis of periodic and intermediate boundary 90\/150 cellular automata. IEEE Trans Comput 45(1):1\u201312","journal-title":"IEEE Trans Comput"},{"issue":"12","key":"9696_CR221","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/12.338094","volume":"43","author":"S Nandi","year":"1994","unstructured":"Nandi S, Kar BK, Chaudhuri PP (1994) Theory and application of cellular automata in cryptography. IEEE Trans Comput 43(12):346\u2013357","journal-title":"IEEE Trans Comput"},{"key":"9696_CR222","doi-asserted-by":"crossref","unstructured":"Naskar N (2015) Characterization and synthesis of non-uniform cellular automata with point state attractors. Ph.D. thesis, Indian Institute of Engineering Science and Technology, Shibpur","DOI":"10.1007\/978-3-319-44365-2_6"},{"key":"9696_CR223","volume-title":"Theory of self-reproducing automata","author":"JV Neumann","year":"1966","unstructured":"Neumann JV (1966) Theory of self-reproducing automata. University of Illinois Press, Champaign"},{"issue":"6","key":"9696_CR224","doi-asserted-by":"publisher","first-page":"7332","DOI":"10.1103\/PhysRevE.60.7332","volume":"60","author":"MEJ Newman","year":"1999","unstructured":"Newman MEJ, Watts DJ (1999) Scaling and percolation in the small-world network model. Phys Rev E 60(6):7332\u20137342","journal-title":"Phys Rev E"},{"key":"9696_CR225","unstructured":"Nishio H (1981) Real time sorting of binary numbers by one-dimensional cellular automata. Technical report, Kyoto University"},{"key":"9696_CR226","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0022-0000(75)80065-1","volume":"11","author":"H Nishio","year":"1975","unstructured":"Nishio H, Kobuchi Y (1975) Fault tolerant cellular space. J Comput Syst Sci 11:150\u2013170","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"9696_CR227","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0304-3975(03)00425-0","volume":"314","author":"K Noguchi","year":"2004","unstructured":"Noguchi K (2004) Simple 8-state minimal time solution to the firing squad synchronization problem. Theor Comput Sci 314(3):303\u2013334","journal-title":"Theor Comput Sci"},{"key":"9696_CR230","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45465-9_28","volume-title":"Automata, Languages and Programming","author":"Nicolas Ollinger","year":"2002","unstructured":"Ollinger N (2002) The quest for small universal cellular automata. In: Proceedings of 29th international colloquium automata, languages and programming, ICALP 2002, Spain. Springer, Berlin, pp 318\u2013329"},{"key":"9696_CR231","doi-asserted-by":"crossref","unstructured":"Ollinger N (2003) The intrinsic universality problem of one-dimensional cellular automata. In: Proceedings of international symposium on theoretical aspects of computer science, STACS 2003. Springer, pp 632\u2013641","DOI":"10.1007\/3-540-36494-3_55"},{"key":"9696_CR500","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2010.08.018","volume":"412","author":"N Ollinger","year":"2011","unstructured":"Ollinger N, Richard G (2011) Four states are enough. Theor Comput Sci 412:22\u201332","journal-title":"Theor Comput Sci"},{"issue":"5\/6","key":"9696_CR232","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/BF01010423","volume":"38","author":"NH Packard","year":"1985","unstructured":"Packard NH, Wolfram S (1985) Two-dimensional cellular automata. J Stat Phys 38(5\/6):901\u2013946","journal-title":"J Stat Phys"},{"key":"9696_CR233","doi-asserted-by":"crossref","unstructured":"Paul K, Chowdhury DR (2000) Application of GF(2$$^p$$) CA in burst error correcting codes. In: Proceedings of international conference of VLSI design, pp 562\u2013567","DOI":"10.1109\/ICVD.2000.812667"},{"key":"9696_CR234","first-page":"269","volume-title":"Lecture Notes in Computer Science","author":"Kolin Paul","year":"1999","unstructured":"Paul K, Chowdhury DR, Chaudhuri PP (1999) Cellular automata based transform coding for image compression. In: Proceedings of international conference on high performance computing (HiPC), pp 269\u2013273"},{"key":"9696_CR235","unstructured":"Paul K, Chowdhury DR, Chaudhuri PP (2000) Scalable pipelined micro-architecture for wavelet transform. In: Proceedings of international conference on VLSI design, pp 144\u2013147"},{"issue":"1\u20132","key":"9696_CR236","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)90232-1","volume":"132","author":"G Pighizzini","year":"1994","unstructured":"Pighizzini G (1994) Asynchronous automata versus asynchronous cellular automata. Theor Comput Sci 132(1\u20132):179\u2013207","journal-title":"Theor Comput Sci"},{"issue":"6","key":"9696_CR237","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1088\/0951-7715\/15\/6\/305","volume":"15","author":"M Pivato","year":"2002","unstructured":"Pivato M (2002) Conservation laws in cellular automata. Nonlinearity 15(6):1781","journal-title":"Nonlinearity"},{"issue":"12","key":"9696_CR238","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TC.1986.1676709","volume":"C\u201335","author":"W Pries","year":"1986","unstructured":"Pries W, Thanailakis A, Card HC (1986) Group properties of cellular automata and VLSI applications. IEEE Trans Comput C\u201335(12):1013\u20131024","journal-title":"IEEE Trans Comput"},{"key":"9696_CR239","unstructured":"Provillard J, Formenti E, Dennunzio A (2011) Non-uniform cellular automata and distributions of rules. arXiv preprint arXiv:11081419"},{"key":"9696_CR240","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0255(93)90052-N","volume":"70","author":"R Raghavan","year":"1993","unstructured":"Raghavan R (1993) Cellular automata in pattern recognition. Inf Sci 70:145\u2013177","journal-title":"Inf Sci"},{"issue":"21","key":"9696_CR241","first-page":"8360","volume":"217","author":"A Mart\u0131n del Rey","year":"2011","unstructured":"Mart\u0131n del Rey A, Rodr\u0131guez S\u0131nchez G (2011) Reversibility of linear cellular automata. Appl Math Comput 217(21):8360\u20138366","journal-title":"Appl Math Comput"},{"key":"9696_CR242","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","volume":"6","author":"D Richardson","year":"1972","unstructured":"Richardson D (1972) Tessellations with local transformations. J Comput Syst Sci 6:373\u2013388","journal-title":"J Comput Syst Sci"},{"key":"9696_CR243","doi-asserted-by":"crossref","unstructured":"Roncken M, Stevens K, Pendurkar R, Rotem S, Chaudhuri PP (2000) Ca-bist for asynchronous circuits: a case study on the rappid asynchronous instruction length decoder. In: Proceedings of advanced research in asynchronous circuits and systems (ASYNC 2000), pp 62\u201372","DOI":"10.1109\/ASYNC.2000.836798"},{"key":"9696_CR244","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/B978-1-4832-3187-7.50019-2","volume-title":"Graph theory and computing","author":"P Rosenstiehl","year":"1972","unstructured":"Rosenstiehl P, Fiksel JR, Holliger A (1972) Intelligent graphs: networks of finite automata capable of solving graph problems. In: Read RC (ed) Graph theory and computing. Academic press, New York, pp 219\u2013265"},{"issue":"7","key":"9696_CR245","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1109\/TIP.2006.877040","volume":"15","author":"PL Rosin","year":"2006","unstructured":"Rosin PL (2006) Training cellular automata for image processing. Trans Imge Process 15(7):2076\u20132087","journal-title":"Trans Imge Process"},{"issue":"7","key":"9696_CR246","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.cviu.2010.02.005","volume":"114","author":"PL Rosin","year":"2010","unstructured":"Rosin PL (2010) Image processing using 3-state cellular automata. Comput Vis Image Underst 114(7):790\u2013802","journal-title":"Comput Vis Image Underst"},{"issue":"6","key":"9696_CR247","first-page":"493","volume":"12","author":"S Roy","year":"2017","unstructured":"Roy S, Das S (2017) Distributed mutual exclusion problem in cellular automata. J Cell Autom 12(6):493\u2013512","journal-title":"J Cell Autom"},{"issue":"2\u20133","key":"9696_CR248","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-3800(97)00179-8","volume":"107","author":"G Ruxton","year":"1998","unstructured":"Ruxton G, Saravia LA (1998) The need for biological realism in the updating of cellular automata models. Ecol Model 107(2\u20133):105\u2013112","journal-title":"Ecol Model"},{"issue":"9","key":"9696_CR249","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.aeue.2012.01.010","volume":"66","author":"S Sadeghi","year":"2012","unstructured":"Sadeghi S, Rezvanian A, Kamrani E (2012) An efficient method for impulse noise reduction from images using fuzzy cellular automata. AEU Int J Electron Commun 66(9):772\u2013779","journal-title":"AEU Int J Electron Commun"},{"key":"9696_CR250","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2014.07.031","volume":"559","author":"V Salo","year":"2014","unstructured":"Salo V (2014) Realization problems for nonuniform cellular automata. Theor Comput Sci 559:91\u2013107","journal-title":"Theor Comput Sci"},{"key":"9696_CR251","doi-asserted-by":"crossref","unstructured":"Santos J, Villot P, Di\u00e9guez M (2013) Protein folding with cellular automata in the 3d hp model. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation, GECCO\u201913, pp 1595\u20131602","DOI":"10.1145\/2464576.2466812"},{"key":"9696_CR252","doi-asserted-by":"publisher","first-page":"168102","DOI":"10.1103\/PhysRevLett.87.168102","volume":"87","author":"RMZ dos Santos","year":"2001","unstructured":"dos Santos RMZ, Coutinho S (2001) Dynamics of HIV approach: a cellular automata approach. Phys Rev Lett 87:168,102","journal-title":"Phys Rev Lett"},{"issue":"10","key":"9696_CR253","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1109\/16.870571","volume":"47","author":"M Saraniti","year":"2000","unstructured":"Saraniti M, Goodnick SM (2000) Hybrid fullband cellular automaton\/monte carlo approach for fast simulation of charge transport in semiconductors. IEEE Trans Electron Devices 47(10):1909\u20131916","journal-title":"IEEE Trans Electron Devices"},{"issue":"1","key":"9696_CR254","doi-asserted-by":"publisher","first-page":"71","DOI":"10.25088\/ComplexSystems.21.1.71","volume":"21","author":"A Sarkar","year":"2012","unstructured":"Sarkar A, Mukherjee A, Das S (2012) Reversibility in asynchronous cellular automata. Complex Syst 21(1):71","journal-title":"Complex Syst"},{"issue":"1","key":"9696_CR255","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/349194.349202","volume":"32","author":"P Sarkar","year":"2000","unstructured":"Sarkar P (2000) A brief history of cellular automata. ACM Comput Surv 32(1):80\u2013107","journal-title":"ACM Comput Surv"},{"issue":"1\u20132","key":"9696_CR256","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(97)00160-6","volume":"197","author":"P Sarkar","year":"1998","unstructured":"Sarkar P, Barua R (1998) Multi-dimensional $$\\sigma $$-automata, $$\\pi $$-polynomial and generalized $$s$$-matrices. Theor Comput Sci 197(1\u20132):111\u2013138","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9696_CR257","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0022-0000(77)80002-0","volume":"15","author":"T Sato","year":"1977","unstructured":"Sato T, Honda N (1977) Certain relations between properties of maps of tessellation automata. J Comput Syst Sci 15(2):121\u2013145","journal-title":"J Comput Syst Sci"},{"issue":"5\u20136","key":"9696_CR258","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.parco.2003.12.014","volume":"30","author":"F Seredynski","year":"2004","unstructured":"Seredynski F, Bouvry P, Zomaya AY (2004) Cellular automata computations and secret key cryptography. Parallel Comput 30(5\u20136):753\u2013766","journal-title":"Parallel Comput"},{"issue":"3","key":"9696_CR259","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037658","volume":"23","author":"M Seredynski","year":"2005","unstructured":"Seredynski M, Bouvry P (2005) Block cipher based on reversible cellular automata. New Gener Comput 23(3):245\u2013258","journal-title":"New Gener Comput"},{"issue":"7","key":"9696_CR260","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/43.55213","volume":"9","author":"M Serra","year":"1990","unstructured":"Serra M, Slater T, Muzio JC, Miller DM (1990) The analysis of one-dimensional linear cellular automata and their aliasing properties. IEEE Trans CAD 9(7):767\u2013778","journal-title":"IEEE Trans CAD"},{"key":"9696_CR261","doi-asserted-by":"crossref","unstructured":"Sethi B, Das S (2015) Convergence of asynchronous cellular automata (under null boundary condition) and their application in pattern classification. In: Recent advances in natural computing: selected results from the IWNC 7 symposium, Springer Japan, pp 35\u201355","DOI":"10.1007\/978-4-431-55105-8_3"},{"key":"9696_CR262","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-981-10-2738-3_3","volume-title":"Security in computing and communications: 4th international symposium, SSCC 2016, Jaipur, India, Sept 21\u201324, 2016, Proceedings","author":"B Sethi","year":"2016","unstructured":"Sethi B, Das S (2016) On the use of asynchronous cellular automata in symmetric-key cryptography. In: Mueller P, Thampi SM, Alam Bhuiyan MZ, Ko R, Doss R, Alcaraz Calero JM (eds) Security in computing and communications: 4th international symposium, SSCC 2016, Jaipur, India, Sept 21\u201324, 2016, Proceedings. Springer, Singapore, pp 30\u201341"},{"key":"9696_CR263","doi-asserted-by":"crossref","unstructured":"Sethi B, Fat\u00e8s N, Das S (2014) Reversibility of elementary cellular automata under fully asynchronous update. In: Proceedings of 11th annual conference theory and applications of models of computation, TAMC 2014, India. Springer, pp 39\u201349","DOI":"10.1007\/978-3-319-06089-7_4"},{"issue":"S1","key":"9696_CR264","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 (2016) Asynchronous cellular automata and pattern classification. Complexity 21(S1):370\u2013386","journal-title":"Complexity"},{"key":"9696_CR265","doi-asserted-by":"crossref","unstructured":"Shaw C, Chatterji D, Maji P, Sen S, Roy BN, Chaudhuri PP (2003) A pipeline architecture for encompression (encryption + compression) technology. In: Proceedings of VLSI design, pp 277\u2013282","DOI":"10.1109\/ICVD.2003.1183150"},{"key":"9696_CR266","doi-asserted-by":"crossref","unstructured":"Shaw C, Maji P, Saha S, Sikdar BK, Roy S, Chaudhuri PP (2004a) Cellular automata based encompression technology for voice data. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2004, Netherlands, pp 258\u2013267","DOI":"10.1007\/978-3-540-30479-1_27"},{"key":"9696_CR267","doi-asserted-by":"crossref","unstructured":"Shaw C, Sikdar BK, Maiti NC (2004b) CA based document compression technology. In: Proceedings of 11th international conference on neural information processing, ICONIP, pp 679\u2013685","DOI":"10.1007\/978-3-540-30499-9_104"},{"key":"9696_CR268","doi-asserted-by":"crossref","unstructured":"Shaw C, Das S, Sikdar BK (2006) Cellular automata based encoding technique for wavelet transformed data targeting still image compression. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2006, France, pp 141\u2013146","DOI":"10.1007\/11861201_19"},{"key":"9696_CR269","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02429850","volume":"2","author":"MA Shereshevsky","year":"1992","unstructured":"Shereshevsky MA (1992) Lyapunov exponent for one-dimensional cellular automata. J Nonlinear Sci 2:1\u20138","journal-title":"J Nonlinear Sci"},{"issue":"11","key":"9696_CR270","doi-asserted-by":"publisher","first-page":"4161","DOI":"10.1016\/j.camwa.2011.09.066","volume":"62","author":"I Siap","year":"2011","unstructured":"Siap I, Akin H, U\u011fuz S (2011) Structure and reversibility of 2d hexagonal cellular automata. Comput Math Appl 62(11):4161\u20134169","journal-title":"Comput Math Appl"},{"key":"9696_CR271","doi-asserted-by":"crossref","unstructured":"Sikdar BK, Paul K, Biswas GP, Boppana V, Yang C, Mukherjee S, Chaudhuri PP (2000) Theory and application of gf($$2^p$$) cellular automata as on-chip test pattern generator. In: Proceedings of 13th international conference on VLSI design, 2000, pp 556\u2013561","DOI":"10.1109\/ICVD.2000.812666"},{"key":"9696_CR272","doi-asserted-by":"crossref","unstructured":"Sikdar BK, Ganguly N, Karmakar A, Chowdhury S, Chaudhuri PP (2001) Multiple attractor cellular automata for hierarchical diagnosis of VLSI circuits. In: Proceedings of 10th Asian test symposium, Japan, pp 385\u2013390","DOI":"10.1109\/ATS.2001.990314"},{"issue":"12","key":"9696_CR273","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.1109\/TCAD.2002.804380","volume":"21","author":"BK Sikdar","year":"2002","unstructured":"Sikdar BK, Ganguly N, Chaudhuri PP (2002) Design of hierarchical cellular automata for on-chip test pattern generator. IEEE Trans Comput Aided Design Integr Circuits Syst 21(12):1530\u20131539","journal-title":"IEEE Trans Comput Aided Design Integr Circuits Syst"},{"issue":"2","key":"9696_CR274","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1142\/S012918319600017X","volume":"7","author":"M Sipper","year":"1996","unstructured":"Sipper M, Tomassini M (1996) Generating parallel random number generators by cellular programming. Int J Modern Phys 7(2):180\u2013190","journal-title":"Int J Modern Phys"},{"key":"9696_CR275","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/S0019-9958(71)90501-8","volume":"18","author":"AR Smith III","year":"1971","unstructured":"Smith AR III (1971a) Cellular automata complexity trade-offs. Inf Control 18:466\u2013482","journal-title":"Inf Control"},{"issue":"3","key":"9696_CR276","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/321650.321652","volume":"18","author":"AR Smith III","year":"1971","unstructured":"Smith AR III (1971b) Simple computation-universal cellular spaces. J ACM 18(3):339\u2013353","journal-title":"J ACM"},{"key":"9696_CR277","unstructured":"Smith AR III (1976) Introduction to and survey of polyautomata theory. In: Automata languages development, pp 405\u2013422"},{"issue":"3","key":"9696_CR278","first-page":"219","volume":"3","author":"JMG Soto","year":"2008","unstructured":"Soto JMG (2008) Computation of explicit preimages in one-dimensional cellular automata applying the de bruijn diagram. J Cell Autom 3(3):219\u2013230 (Special Issues)","journal-title":"J Cell Autom"},{"issue":"7","key":"9696_CR279","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S0167-739X(02)00073-0","volume":"18","author":"M Stratmann","year":"2002","unstructured":"Stratmann M, Worsch T (2002) Leader election in d-dimensional ca in time diam log(diam). Future Gener Comput Syst 18(7):939\u2013950","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"9696_CR280","first-page":"19","volume":"5","author":"K Sutner","year":"1991","unstructured":"Sutner K (1991) De bruijin graphs and linear cellular automata. Complex Syst 5(1):19\u201330","journal-title":"Complex Syst"},{"key":"9696_CR281","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.physa.2004.06.067","volume":"343","author":"T Suzudo","year":"2004","unstructured":"Suzudo T (2004) Spatial pattern formation in asynchronous cellular automata with mass conservation. Physica A 343:185\u2013200","journal-title":"Physica A"},{"issue":"2","key":"9696_CR282","first-page":"149","volume":"9","author":"S Takesue","year":"1995","unstructured":"Takesue S (1995) Staggered invariants in cellular automata. Complex Syst 9(2):149\u2013168","journal-title":"Complex Syst"},{"issue":"2","key":"9696_CR283","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2003.08.011","volume":"312","author":"V Terrier","year":"2004","unstructured":"Terrier V (2004) Two-dimensional cellular automata and their neighborhoods. Theor Comput Sci 312(2):203\u2013222","journal-title":"Theor Comput Sci"},{"key":"9696_CR284","unstructured":"Thatcher JW (1964) Universality in the von neumann cellular model. Technical report, DTIC Document"},{"key":"9696_CR285","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","volume":"15","author":"T Toffoli","year":"1977","unstructured":"Toffoli T (1977) Computation and construction universality of reversible cellular automata. J Comput Syst Sci 15:213\u2013231","journal-title":"J Comput Syst Sci"},{"key":"9696_CR286","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular automata machines: a new environment for modeling","author":"T Toffoli","year":"1987","unstructured":"Toffoli T, Margolus N (1987) Cellular automata machines: a new environment for modeling. MIT Press, Cambridge"},{"issue":"1","key":"9696_CR287","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0167-2789(90)90185-R","volume":"45","author":"T Toffoli","year":"1990","unstructured":"Toffoli T, Margolus NH (1990) Invertible cellular automata: a review. Physica D 45(1):229\u2013253","journal-title":"Physica D"},{"key":"9696_CR288","first-page":"14","volume-title":"Lecture Notes in Computer Science","author":"Marco Tomassini","year":"2006","unstructured":"Tomassini M (2006) Generalized automata networks. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2006, France. Springer, Berlin, pp 14\u201328"},{"key":"9696_CR289","first-page":"44","volume-title":"Lecture Notes in Computer Science","author":"Marco Tomassini","year":"2002","unstructured":"Tomassini M, Venzi M (2002) Artificially evolved asynchronous cellular automata for the density task. In: Proceedings of international conference on cellular automata, research and industry, ACRI 2002, Switzerland. Springer, Berlin, pp 44\u201355"},{"issue":"10","key":"9696_CR290","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/12.888056","volume":"49","author":"M Tomassini","year":"2000","unstructured":"Tomassini M, Sipper M, Perrenoud M (2000) On the generation of high-quality random numbers by two-dimensional cellular automata. IEEE Trans Comput 49(10):1146\u20131151","journal-title":"IEEE Trans Comput"},{"key":"9696_CR291","doi-asserted-by":"crossref","first-page":"261","DOI":"10.25088\/ComplexSystems.15.4.261","volume":"15","author":"M Tomassini","year":"2005","unstructured":"Tomassini M, Giacobini M, Darabos C (2005) Evolution and dynamics of small-world cellular automata. Complex Syst 15:261\u2013284","journal-title":"Complex Syst"},{"issue":"17","key":"9696_CR292","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1049\/el:19900869","volume":"26","author":"P Tsalides","year":"1990","unstructured":"Tsalides P (1990) Cellular automata based built-in self-test structures for VLSI systems. Electron Lett 26(17):1350\u20131352","journal-title":"Electron Lett"},{"issue":"4","key":"9696_CR293","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1049\/ip-e.1991.0031","volume":"138","author":"P Tsalides","year":"1991","unstructured":"Tsalides P, York TA, Thanailakis A (1991) Pseudo-random number generators for VLSI systems based on linear cellular automata. IEEE Proc E Comput Digit Tech 138(4):241\u2013249","journal-title":"IEEE Proc E Comput Digit Tech"},{"issue":"06","key":"9696_CR294","doi-asserted-by":"publisher","first-page":"1350101","DOI":"10.1142\/S0218127413501010","volume":"23","author":"S U\u011fuz","year":"2013","unstructured":"U\u011fuz S, Akin H, Siap I (2013) Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries. Int J Bifurc Chaos 23(06):1350101","journal-title":"Int J Bifurc Chaos"},{"issue":"1","key":"9696_CR295","doi-asserted-by":"publisher","first-page":"1430,002","DOI":"10.1142\/S021812741430002X","volume":"24","author":"S U\u011fuz","year":"2014","unstructured":"U\u011fuz S, Sahin U, Akin H, Siap I (2014) Self-replicating patterns in 2D linear cellular automata. Int J Bifurc Chaos 24(1):1430,002","journal-title":"Int J Bifurc Chaos"},{"issue":"4","key":"9696_CR296","first-page":"403","volume":"1","author":"H Umeo","year":"2005","unstructured":"Umeo H, Hisaoka M, Sogabe T (2005) A survey on optimum-time firing squad synchronization algorithms for one-dimensional cellular automata. Intl J Unconv Comput 1(4):403\u2013426","journal-title":"Intl J Unconv Comput"},{"issue":"1","key":"9696_CR297","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0167-2789(84)90253-7","volume":"10","author":"GY Vichniac","year":"1984","unstructured":"Vichniac GY (1984) Simulating physics with cellular automata. Physica D 10(1):96\u2013116","journal-title":"Physica D"},{"issue":"4","key":"9696_CR298","first-page":"293","volume":"3","author":"R Vollmar","year":"1977","unstructured":"Vollmar R (1977) On two modified problems of synchronization in cellular automata. Acta Cybern 3(4):293\u2013300","journal-title":"Acta Cybern"},{"issue":"5","key":"9696_CR299","first-page":"373","volume":"11","author":"B Voorhees","year":"1997","unstructured":"Voorhees B (1997) Some parameters characterizing cellular automata rules. Complex Syst 11(5):373\u2013386","journal-title":"Complex Syst"},{"issue":"3","key":"9696_CR300","first-page":"187","volume":"3","author":"B Voorhees","year":"2008","unstructured":"Voorhees B (2008) Remarks on applications of de bruijn diagrams and their fragments. J Cell Autom 3(3):187\u2013204","journal-title":"J Cell Autom"},{"key":"9696_CR301","doi-asserted-by":"crossref","unstructured":"Wang Q, Yu S, Ding W, Leng M (2008) Generating high-quality random numbers by cellular automata with pso. In: Proceedings of 4th international conference on natural computation, ICNC\u201908, pp 430\u2013433","DOI":"10.1109\/ICNC.2008.560"},{"issue":"4","key":"9696_CR302","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0019-3577(94)90020-5","volume":"5","author":"T Ward","year":"1994","unstructured":"Ward T (1994) Automorphisms of $${{\\mathbb{Z}}}^d$$-subshifts of finite type. Indag Math 5(4):495\u2013504","journal-title":"Indag Math"},{"issue":"6684","key":"9696_CR303","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"3","key":"9696_CR304","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55(3):601\u2013644","journal-title":"Rev Mod Phys"},{"key":"9696_CR305","first-page":"1","volume":"10","author":"S Wolfram","year":"1984","unstructured":"Wolfram S (1984) Universality and complexity in cellular automata. Physica 10:1\u201335","journal-title":"Physica"},{"key":"9696_CR306","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1103\/PhysRevLett.55.449","volume":"55","author":"S Wolfram","year":"1985","unstructured":"Wolfram S (1985) Origins of randomness in physical systems. Phys Rev Lett 55:449\u2013452","journal-title":"Phys Rev Lett"},{"key":"9696_CR307","doi-asserted-by":"crossref","unstructured":"Wolfram S (1986a) Cryptography with cellular automata. In: Advances in cryptology\u2014Crypto\u201985, vol 218. Springer, pp 429\u2013432","DOI":"10.1007\/3-540-39799-X_32"},{"issue":"2","key":"9696_CR308","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0196-8858(86)90028-X","volume":"7","author":"S Wolfram","year":"1986","unstructured":"Wolfram S (1986b) Random sequence generation by cellular automata. Adv Appl Math 7(2):123\u2013169","journal-title":"Adv Appl Math"},{"key":"9696_CR309","unstructured":"Wolfram S (1994) Cellular automata and complexity\u2013collected papers. Westview Press"},{"key":"9696_CR310","volume-title":"A new kind of science","author":"S Wolfram","year":"2002","unstructured":"Wolfram S (2002) A new kind of science. Wolfram-Media, Champaign"},{"issue":"2","key":"9696_CR311","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S1047-3203(03)00022-1","volume":"14","author":"S Wongthanavasu","year":"2003","unstructured":"Wongthanavasu S, Sadananda R (2003) A ca-based edge operator and its performance evaluation. J Vis Commun Image Represent 14(2):83\u201396","journal-title":"J Vis Commun Image Represent"},{"key":"9696_CR312","unstructured":"Wuensche A (1994) Complexity in one-D cellular automata: gliders, basins of attraction and the z parameter. Working papers 94-04-025, Santa Fe Institute"},{"key":"9696_CR313","unstructured":"Wuensche A (1998) Classifying cellular automata automatically. Santa Fe Institute Working Paper 98-02-018"},{"key":"9696_CR314","unstructured":"Wuensche A (2017) Discrete dynamics lab. http:\/\/www.ddlab.com\/ . Accessed Aug 25, 2017"},{"issue":"4","key":"9696_CR315","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1002\/jcc.20354","volume":"27","author":"X Xiao","year":"2006","unstructured":"Xiao X, Shao S, Huang Z, Chou K (2006) Using pseudo amino acid composition to predict protein structural classes: approached with complexity measure factor. J Comput Chem 27(4):478\u2013482","journal-title":"J Comput Chem"},{"key":"9696_CR316","unstructured":"Yang XS, Yang YZ (2007) Cellular automata networks. In: Proceedings of unconventional computing. Luniver Press, pp 280\u2013302"},{"key":"9696_CR317","doi-asserted-by":"crossref","unstructured":"Ye R, Li H (2008) A novel image scrambling and watermarking scheme based on cellular automata. In: Proceedings of international symposium on electronic commerce and security, pp 938\u2013941","DOI":"10.1109\/ISECS.2008.138"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9696-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-018-9696-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9696-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T23:21:00Z","timestamp":1751757660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-018-9696-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":320,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["9696"],"URL":"https:\/\/doi.org\/10.1007\/s11047-018-9696-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"23 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}