{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:46:57Z","timestamp":1764557217006},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_31","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T12:59:50Z","timestamp":1292590790000},"page":"416-426","source":"Crossref","is-referenced-by-count":4,"title":["A New Dimension Sensitive Property for Cellular Automata"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Bernardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Durand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Formenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Fundamenta Informaticae","author":"N. Boccara","year":"2002","unstructured":"Boccara, N., Fuk\u015b, H.: Number-conserving cellular automaton rules. In: Fundamenta Informaticae, IOS Press, Amsterdam (2002)"},{"issue":"1-3","key":"31_CR2","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., Rka, Z.: Number conserving cellular automata I: decidability. TCS\u00a0299(1-3), 523\u2013535 (2003)","journal-title":"TCS"},{"key":"31_CR3","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.: Number conserving cellular automata II: dynamics. Theoretical Computer Science\u00a0304, 269\u2013290 (2003)","journal-title":"Theoretical Computer Science"},{"key":"31_CR4","unstructured":"Fujita, K., Imai, K., Iwamoto, C., Morita, K.: Self-Reproduction and Logical Universality in Number-Conserving CA. In: Seventh International Workshop on Cellular Automata, Hyeres, France (September 2001)"},{"key":"31_CR5","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.: Condition for Injectivity of Global Maps for Tessellation Automata. Information and Control\u00a032, 158\u2013162 (1976)","journal-title":"Information and Control"},{"key":"31_CR6","unstructured":"Morita, K., Imai, K.: Number-Conserving Reversible Cellular Automata and their Computation-Universality. In: Proceedings of the MFCS 1998 Satellite Workshop on CA (1998)"},{"key":"31_CR7","first-page":"149","volume":"9","author":"S. Takesue","year":"1995","unstructured":"Takesue, S.: Staggered invariants in cellular automata. Complex Systems\u00a09, 149\u2013168 (1995)","journal-title":"Complex Systems"},{"key":"31_CR8","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.: Reversibility and Surjectivity Problems of Cellular Automata. Journal of Computer and System Sciences\u00a048, 149\u2013182 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0304-3975(94)90244-5","volume":"134","author":"B. Durand","year":"1994","unstructured":"Durand, B.: Inversion of 2D cellular automata: some complexity results. Theoretical Computer Science\u00a0134, 387\u2013401 (1994)","journal-title":"Theoretical Computer Science"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/S0022-0000(05)80077-7","volume":"49","author":"B. Durand","year":"1994","unstructured":"Durand, B.: The Surjectivity Problem for 2D Cellular Automata. Journal of Computer and System Sciences\u00a049, 718\u2013725 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(79)90051-5","volume":"18","author":"A. Maruoka","year":"1979","unstructured":"Maruoka, A., Kimura, M.: Injectivity and surjectivity of parallel maps for cellular automata. Journal of Computer and System Sciences\u00a018, 158\u2013162 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(94)90041-8","volume":"127","author":"J. Kari","year":"1994","unstructured":"Kari, J.: Rice\u2019s theorem for the limit set of cellular automata. Theoretical Computer Science\u00a0127, 229\u2013254 (1994)","journal-title":"Theoretical Computer Science"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1051\/jp1:1992277","volume":"2","author":"K. Nagel","year":"1992","unstructured":"Nagel, K., Schreckenberg, M.: A cellular automaton for freeway traffic. Journal Physics I\u00a02, 2221\u20132229 (1992)","journal-title":"Journal Physics I"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Durand, B.: Global properties of cellular automata. Cellular Automata and Complex Systems (1998)","DOI":"10.1007\/978-94-015-9223-9_1"},{"key":"31_CR15","first-page":"177","volume":"2","author":"K. Culik","year":"1988","unstructured":"Culik, K., Yu, S.: Undecidability of CA Classification Schemes. Complex Systems\u00a02, 177\u2013190 (1988)","journal-title":"Complex Systems"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/0218057","volume":"18","author":"K. Culik","year":"1989","unstructured":"Culik, K., Pachl, J., Yu, S.: On the Limit Sets of Cellular Automata. SIAM Journal on Computing\u00a018, 831\u2013842 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR17","first-page":"1","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Bell System Tech. Journal\u00a040, 1\u201342 (1961)","journal-title":"Journal"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:30:44Z","timestamp":1558294244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}