{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:11:38Z","timestamp":1743099098016,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115191"},{"type":"electronic","value":"9783319115207"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11520-7_57","type":"book-chapter","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T05:05:05Z","timestamp":1410498305000},"page":"546-555","source":"Crossref","is-referenced-by-count":0,"title":["Inner-Independent Radius-Dependent Totalistic Rule of Universal Asynchronous Cellular Automaton"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Adachi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1\/2","key":"57_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:JOSS.0000003112.54283.ac","volume":"114","author":"S. Adachi","year":"2004","unstructured":"Adachi, S., Peper, F., Lee, J.: Computation by asynchronously updating cellular automata. J. Stat. Phys.\u00a0114(1\/2), 261\u2013289 (2004)","journal-title":"J. Stat. Phys."},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-30479-1_10","volume-title":"Cellular Automata","author":"S. Adachi","year":"2004","unstructured":"Adachi, S., Peper, F., Lee, J.: Universality of Hexagonal Asynchronous Totalistic Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol.\u00a03305, pp. 91\u2013100. Springer, Heidelberg (2004)"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Adachi, S., Lee, J., Peper, F.: Universal 2-State Asynchronous Cellular Automaton with Inner-Independent Transitions. In: Proc. of 4th International Workshop on Natural Computing (IWNC 2009). Proceedings in Information and Communications Technology (PICT 2), pp. 107\u2013116. Springer-Japan (2009)","DOI":"10.1007\/978-4-431-53868-4_12"},{"key":"57_CR4","unstructured":"Adachi, S., Lee, J., Peper, F.: Universality of 2-State Asynchronous Cellular Automaton with Inner-Independent Totalistic Transitions. In: 16th International Workshop on Cellular Automata and Discrete Complex Systems, pp. 153\u2013172 (2010)"},{"key":"57_CR5","volume-title":"Wining Ways for Your Mathematical Plays","author":"E.R. Berlekamp","year":"1982","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Wining Ways for Your Mathematical Plays, vol.\u00a02. Academic Press, New York (1982)"},{"issue":"1","key":"57_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/5.362752","volume":"83","author":"S. Hauck","year":"1995","unstructured":"Hauck, S.: Asynchronous design methodologies: an overview. Proc. IEEE\u00a083(1), 69\u201393 (1995)","journal-title":"Proc. IEEE"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-2789(84)90249-5","volume":"10","author":"T.E. Ingerson","year":"1984","unstructured":"Ingerson, T.E., Buvel, R.L.: Structures in asynchronous cellular automata. Physica D\u00a010, 59\u201368 (1984)","journal-title":"Physica D"},{"issue":"1","key":"57_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/T-C.1974.223773","volume":"C-23","author":"R.M. Keller","year":"1974","unstructured":"Keller, R.M.: Towards a theory of universal speed-independent modules. IEEE Trans. Comput.\u00a0C-23(1), 21\u201333 (1974)","journal-title":"IEEE Trans. Comput."},{"issue":"3\/4","key":"57_CR9","first-page":"295","volume":"58","author":"J. Lee","year":"2003","unstructured":"Lee, J., Adachi, S., Peper, F., Morita, K.: Embedding universal delay-insensitive circuits in asynchronous cellular spaces. Fund. Inform.\u00a058(3\/4), 295\u2013320 (2003)","journal-title":"Fund. Inform."},{"key":"57_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jcss.2004.10.009","volume":"70","author":"J. Lee","year":"2005","unstructured":"Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. Journal of Computer and System Sciences\u00a070, 201\u2013220 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"57_CR11","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TCSI.2005.844229","volume":"52","author":"J. Lee","year":"2005","unstructured":"Lee, J., Peper, F., Adachi, S., Mashiko, S.: Universal Delay-Insensitive Systems With Buffering Lines. IEEE Trans. Circuits and Systems\u00a052(4), 742\u2013754 (2005)","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"57_CR12","first-page":"278","volume-title":"Proc. of Automata 2008","author":"J. Lee","year":"2008","unstructured":"Lee, J., Peper, F.: On brownian cellular automata. In: Proc. of Automata 2008, pp. 278\u2013291. Luniver Press, UK (2008)"},{"key":"57_CR13","unstructured":"von Neumann, J.: The Theory of Self-Reproducing Automata, edited and completed by A. W. Burks. University of Illinois Press (1966)"},{"key":"57_CR14","first-page":"196","volume-title":"Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems","author":"P. Patra","year":"1994","unstructured":"Patra, P., Fussell, D.S.: Efficient building blocks for delay insensitive circuits. In: Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems, pp. 196\u2013205. IEEE Computer Society Press, Silver Spring (1994)"},{"issue":"4","key":"57_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1088\/0957-4484\/14\/4\/312","volume":"14","author":"F. Peper","year":"2003","unstructured":"Peper, F., Lee, J., Adachi, S., Mashiko, S.: Laying out circuits on asynchronous cellular arrays: a step towards feasible nanocomputers? Nanotechnology\u00a014(4), 469\u2013485 (2003)","journal-title":"Nanotechnology"},{"issue":"1","key":"57_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/TNANO.2004.824034","volume":"3","author":"F. Peper","year":"2004","unstructured":"Peper, F., Lee, J., Abo, F., Isokawa, T., Adachi, S., Matsui, N., Mashiko, S.: Fault-Tolerance in Nanocomputers: A Cellular Array Approach. IEEE Trans. Nanotech.\u00a03(1), 187\u2013201 (2004)","journal-title":"IEEE Trans. Nanotech."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11520-7_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:11:57Z","timestamp":1676891517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11520-7_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115191","9783319115207"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11520-7_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}