{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:42:00Z","timestamp":1742989320977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_27","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"351-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Block Representation of Reversible Causal Graph Dynamics"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Arrighi","sequence":"first","affiliation":[]},{"given":"Simon","family":"Martiel","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-31585-5_9","volume-title":"Automata, Languages, and Programming","author":"P Arrighi","year":"2012","unstructured":"Arrighi, P., Dowek, G.: Causal graph dynamics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 54\u201366. Springer, Heidelberg (2012)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s11047-011-9277-6","volume":"11","author":"P Arrighi","year":"2012","unstructured":"Arrighi, P., Grattage, J.: Partitioned quantum cellular automata are intrinsically universal. Nat. Comput. 11, 13\u201322 (2012)","journal-title":"Nat. Comput."},{"unstructured":"Arrighi, P., Martiel, S., Nesme, V.: Generalized Cayley graphs and cellular automata over them. submitted (long version) (2013). Pre-print arXiv:1212.0027","key":"27_CR3"},{"doi-asserted-by":"crossref","unstructured":"Arrighi, P., Martiel, S., Perdrix, P.: Reversible Causal Graph Dynamics (2015). Pre-print arXiv:1502.04368","key":"27_CR4","DOI":"10.1007\/978-3-319-40578-0_5"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.jcss.2010.05.004","volume":"77","author":"P Arrighi","year":"2010","unstructured":"Arrighi, P., Nesme, V., Werner, R.: Unitarity plus causality implies localizability. J. Comput. Syst. Sci. 77, 372\u2013378 (2010). QIP 2010 (long talk)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2\u20133","key":"27_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P Boehm","year":"1987","unstructured":"Boehm, P., Fonio, H.R., Habel, A.: Amalgamation of graph transformations: a synchronization mechanism. J. Comput. Syst. Sci. 34(2\u20133), 377\u2013408 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR7","first-page":"154","volume":"145","author":"JO Durand-Lose","year":"2001","unstructured":"Durand-Lose, J.O.: Representing reversible cellular automata with reversible block cellular automata. Discrete Math. Theor. Comput. Sci. 145, 154 (2001)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1\u20132","key":"27_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(93)90066-3","volume":"109","author":"H Ehrig","year":"1993","unstructured":"Ehrig, H., Lowe, M.: Parallel and distributed derivations in the single-pushout approach. Theor. Comput. Sci. 109(1\u20132), 123\u2013143 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3, 320\u2013375 (1969)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"27_CR10","first-page":"47","volume":"29","author":"J Kari","year":"1996","unstructured":"Kari, J.: Representation of reversible cellular automata with block permutations. Theory Comput. Syst. 29(1), 47\u201361 (1996)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20132","key":"27_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-1999-381208","volume":"38","author":"J Kari","year":"1999","unstructured":"Kari, J.: On the circuit depth of structurally reversible cellular automata. Fundamenta Informaticae 38(1\u20132), 93\u2013107 (1999)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Konopka, T., Markopoulou, F., Smolin, L.: Quantum graphity. Arxiv preprint (2006). Pre-print arXiv:hep-th\/0611197","key":"27_CR12"},{"issue":"6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0020-0190(92)90231-J","volume":"42","author":"K Morita","year":"1992","unstructured":"Morita, K.: Computation-universality of one-dimensional one-way reversible cellular automata. Inf. Process. Lett. 42(6), 325\u2013329 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1103\/PhysRevD.12.385","volume":"12","author":"R Sorkin","year":"1975","unstructured":"Sorkin, R.: Time-evolution problem in Regge calculus. Phys. Rev. D. 12(2), 385\u2013396 (1975)","journal-title":"Phys. Rev. D."},{"doi-asserted-by":"crossref","unstructured":"Taentzer, G.: Parallel and distributed graph transformation: Formal description and application to communication-based systems. Ph.D. thesis, Technische Universitat Berlin (1996)","key":"27_CR15","DOI":"10.1007\/3-540-61228-9_95"},{"issue":"1\u20132","key":"27_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(96)00215-0","volume":"186","author":"G Taentzer","year":"1997","unstructured":"Taentzer, G.: Parallel high-level replacement systems. Theor. comput. sci. 186(1\u20132), 43\u201381 (1997)","journal-title":"Theor. comput. sci."},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0167-2789(02)00601-2","volume":"171","author":"K Tomita","year":"2002","unstructured":"Tomita, K., Kurokawa, H., Murata, S.: Graph automata: natural expression of self-reproduction. Phys. D: Nonlin. Phenom. 171(4), 197\u2013210 (2002)","journal-title":"Phys. D: Nonlin. Phenom."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:23:37Z","timestamp":1674246217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}