{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810061,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084930"},{"type":"electronic","value":"9783319084947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08494-7_5","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:50:00Z","timestamp":1404571800000},"page":"54-66","source":"Crossref","is-referenced-by-count":1,"title":["Trace Complexity of Chaotic Reversible Cellular Automata"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ville","family":"Salo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"T\u00f6rm\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-19805-2_4","volume-title":"Foundations of Software Science and Computational Structures","author":"H.B. Axelsen","year":"2011","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: What do reversible programs compute? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 42\u201356. Springer, Heidelberg (2011)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Develop.\u00a017, 525\u2013532 (1973)","journal-title":"IBM J. Res. Develop."},{"issue":"4","key":"5_CR3","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1215\/ijm\/1258138511","volume":"48","author":"M. Boyle","year":"2004","unstructured":"Boyle, M.: Some sofic shifts cannot commute with nonwandering shifts of finite type. Illinois J. Math.\u00a048(4), 1267\u20131277 (2004)","journal-title":"Illinois J. Math."},{"issue":"1","key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M. Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Complex Systems\u00a015(1), 1\u201340 (2004)","journal-title":"Complex Systems"},{"issue":"4","key":"5_CR5","first-page":"463","volume":"74","author":"J.-C. Delvenne","year":"2006","unstructured":"Delvenne, J.-C., K\u016frka, P., Blondel, V.: Decidability and universality in symbolic dynamical systems. Fund. Inform.\u00a074(4), 463\u2013490 (2006)","journal-title":"Fund. Inform."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-31834-7_8","volume-title":"Machines, Computations, and Universality","author":"J.-C. Delvenne","year":"2005","unstructured":"Delvenne, J.-C., K\u016frka, P., Blondel, V.D.: Computational universality in symbolic dynamical systems. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 104\u2013115. Springer, Heidelberg (2005)"},{"key":"5_CR7","series-title":"Addison-Wesley Studies in Nonlinearity","volume-title":"An introduction to chaotic dynamical systems","author":"R.L. Devaney","year":"1989","unstructured":"Devaney, R.L.: An introduction to chaotic dynamical systems, 2nd edn. Addison-Wesley Studies in Nonlinearity. Addison-Wesley Publishing Company Advanced Book Program, Redwood City (1989)","edition":"2"},{"key":"5_CR8","series-title":"Math. Appl.","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-94-015-9153-9_2","volume-title":"Cellular automata (Saissac 1996)","author":"B. Durand","year":"1999","unstructured":"Durand, B., R\u00f3ka, Z.: The game of life: universality revisited. In: Cellular automata (Saissac 1996). Math. Appl., vol.\u00a0460, pp. 51\u201374. Kluwer Acad. Publ., Dordrecht (1999)"},{"issue":"1-2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(96)00025-4","volume":"174","author":"P. K\u016frka","year":"1997","unstructured":"K\u016frka, P.: On topological dynamics of Turing machines. Theoret. Comput. Sci.\u00a0174(1-2), 203\u2013216 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR10","unstructured":"Lukkarila, V.: Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata. Technical Report 927, TUCS (2009)"},{"key":"5_CR11","unstructured":"Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. The Transactions of The IEICE\u00a0E72-E(6), 758\u2013762 (1989)"},{"key":"5_CR12","unstructured":"Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible turing machine. The Transactions of the IEICE\u00a0E72, 223\u2013228 (1989)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Nasu, M.: Textile systems for endomorphisms and automorphisms of the shift. Mem. Amer. Math. Soc.\u00a0114(546), viii+215 (1995)","DOI":"10.1090\/memo\/0546"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0143385707000375","volume":"28","author":"M. Nasu","year":"2008","unstructured":"Nasu, M.: Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. Ergodic Theory and Dynamical Systems\u00a028, 167\u2013209 (2008)","journal-title":"Ergodic Theory and Dynamical Systems"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Sacks, G.E.: Higher recursion theory. Perspectives in mathematical logic. Springer (1990)","DOI":"10.1007\/978-3-662-12013-2"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/321650.321652","volume":"18","author":"A.R. Smith III","year":"1971","unstructured":"Smith III, A.R.: Simple computation-universal cellular spaces. J. Assoc. Comput. Mach.\u00a018, 339\u2013353 (1971)","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR17","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Wolfram, S.: Universality and complexity in cellular automata. Phys. D\u00a010(1-2), 1\u201335 (1983); Cellular automata (Los Alamos, N.M., 1983)","DOI":"10.1016\/0167-2789(84)90245-8"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08494-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:24Z","timestamp":1746294564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}