{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:56:10Z","timestamp":1760550970811,"version":"3.44.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1016\/j.ins.2019.10.068","type":"journal-article","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T01:57:21Z","timestamp":1572573441000},"page":"180-189","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Ternary reversible number-conserving cellular automata are trivial"],"prefix":"10.1016","volume":"513","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2935-5529","authenticated-orcid":false,"given":"Barbara","family":"Wolnik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3876-620X","authenticated-orcid":false,"given":"Bernard","family":"De Baets","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2019.10.068_bib0001","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","article-title":"Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures","volume":"6","author":"Amoroso","year":"1972","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0002","first-page":"521","article-title":"A note on the reversibility of 2D cellular automata on hexagonal grids","volume":"13","author":"Augustynowicz","year":"2018","journal-title":"J. Cell. Autom."},{"key":"10.1016\/j.ins.2019.10.068_bib0003","first-page":"213","article-title":"Reversibility of d-state finite cellular automata","volume":"11","author":"Bhattacharjee","year":"2016","journal-title":"J. Cell. Autom."},{"key":"10.1016\/j.ins.2019.10.068_bib0004","first-page":"1","article-title":"Number-conserving cellular automaton rules","volume":"52","author":"Boccara","year":"2002","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.ins.2019.10.068_bib0005","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.jhydrol.2018.06.021","article-title":"Cellular automata and finite volume solvers converge for 2D shallow flow modelling for hydrological modelling","volume":"563","author":"Caviedes-Voulli\u00e9me","year":"2018","journal-title":"J. Hydrol."},{"key":"10.1016\/j.ins.2019.10.068_bib0006","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2016.01.062","article-title":"On the bernoulli automorphism of the reversible linear cellular automata","volume":"345","author":"Chang","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0007","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1049\/ip-e.1990.0008","article-title":"Efficient characterisation of cellular automata","volume":"137","author":"Das","year":"1990","journal-title":"IEE Proc. E - Comput. Dig. Tech."},{"key":"10.1016\/j.ins.2019.10.068_bib0008","first-page":"365","article-title":"A note on the reversibility of elementary cellular automaton 150 with periodic boundary conditions","volume":"16","author":"del Rey","year":"2013","journal-title":"Roman. J. Inf. Sci. Technol."},{"key":"10.1016\/j.ins.2019.10.068_bib0009","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1142\/S0129183106009680","article-title":"On the reversibility of 150\u202fwolfram cellular automata","volume":"17","author":"del Rey","year":"2006","journal-title":"Int. J. Modern Phys. C"},{"key":"10.1016\/j.ins.2019.10.068_bib0010","first-page":"8360","article-title":"Reversibility of linear cellular automata","volume":"217","author":"del Rey","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2019.10.068_bib0011","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ins.2019.02.023","article-title":"On the dynamical behaviour of linear higher-order cellular automata and its decidability","volume":"486","author":"Dennunzio","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0012","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0022-0000(75)80059-6","article-title":"On reversibility in cellular automata","volume":"11","author":"Di Gregorio","year":"1975","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0013","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0304-3975(02)00534-0","article-title":"Number-conserving cellular automata i: decidability","volume":"299","author":"Durand","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0014","doi-asserted-by":"crossref","unstructured":"A. Dzedzej, B. Wolnik, M. Dziemia\u0144czuk, A. Nenca, J.M. Baetens, B. De Baets, A two-layer representation of four-state reversible number-conserving 2D cellular automata, J. Stat. Mech. (2019) 073202, https:\/\/doi.org\/10.1088\/1742-5468\/ab25df.","DOI":"10.1088\/1742-5468\/ab25df"},{"key":"10.1016\/j.ins.2019.10.068_bib0015","doi-asserted-by":"crossref","unstructured":"A. Dzedzej, B. Wolnik, A. Nenca, J.M. Baetens, B. De Baets, Efficient enumeration of three-state two-dimensional number-conserving cellular automata, accepted to Information and Computation, 2019b.","DOI":"10.1016\/j.ic.2020.104534"},{"key":"10.1016\/j.ins.2019.10.068_bib0016","first-page":"1782","article-title":"Inverse rules of ECA with rule number 150","volume":"189","author":"Encinas","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2019.10.068_bib0017","first-page":"75","article-title":"Explorations of ternary cellular automata and ternary density classification problems","volume":"12","author":"Fuk\u015b","year":"2019","journal-title":"Acta Physica Polonica B"},{"key":"10.1016\/j.ins.2019.10.068_bib0018","first-page":"147","article-title":"Product decomposition for surjective 2-block NCCA","author":"Garc\u00eda-Ramos","year":"2011","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0019","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01691062","article-title":"Endomorphisms and automorphisms of shift dynamical systems","volume":"3","author":"Hedlund","year":"1969","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.ins.2019.10.068_bib0020","series-title":"Reversibility and Universality","first-page":"269","article-title":"On radius 1 nontrivial reversible and number-conserving cellular automata","author":"Imai","year":"2018"},{"key":"10.1016\/j.ins.2019.10.068_bib0021","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0022-0000(83)90033-8","article-title":"Linear cellular automata over Zm","volume":"27","author":"It\u00f4","year":"1983","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0022","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","article-title":"Reversibility of 2D cellular automata is undecidable","volume":"45","author":"Kari","year":"1990","journal-title":"Physica D Nonlinear Phenomena"},{"key":"10.1016\/j.ins.2019.10.068_bib0023","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","article-title":"Theory of cellular automata: a survey","volume":"334","author":"Kari","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0024","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00354-018-0034-6","article-title":"Reversible cellular automata: from fundamental classical results to recent developments","volume":"36","author":"Kari","year":"2018","journal-title":"New Gener. Comput."},{"key":"10.1016\/j.ins.2019.10.068_bib0025","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1006\/jcss.1997.1535","article-title":"Invertible linear cellular automata over Zm: algorithmic and dynamical aspects","volume":"56","author":"Manzini","year":"1998","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0026","doi-asserted-by":"crossref","first-page":"5563","DOI":"10.1088\/0305-4470\/35\/27\/303","article-title":"Matrix methods and local properties of reversible one-dimensional cellular automata","volume":"35","author":"Mora","year":"2002","journal-title":"J. Physics A Math. Gen."},{"key":"10.1016\/j.ins.2019.10.068_bib0027","doi-asserted-by":"crossref","unstructured":"K. Morita, Reversible Cellular Automata, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 231\u2013257.","DOI":"10.1007\/978-3-540-92910-9_7"},{"year":"2017","series-title":"Theory of Reversible Computing","author":"Morita","key":"10.1016\/j.ins.2019.10.068_bib0028"},{"key":"10.1016\/j.ins.2019.10.068_bib0029","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","article-title":"Tessellation with local transformations","volume":"6","author":"Richardson","year":"1972","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2019.10.068_bib0030","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(98)00004-3","article-title":"The set of reversible 90\/150 cellular automata is regular","volume":"84","author":"Sarkar","year":"1998","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.ins.2019.10.068_bib0031","first-page":"77","article-title":"Derivation and representation of one-dimensional, reversible, number-conserving cellular automata rules","volume":"6","author":"Schranko","year":"2011","journal-title":"J. Cell. Autom."},{"key":"10.1016\/j.ins.2019.10.068_bib0032","first-page":"23","article-title":"A closed formula for the inverse of a reversible cellular automaton with (2R+1)-cyclic rule","volume":"357","author":"Serrano","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2019.10.068_bib0033","first-page":"19","article-title":"De Bruijn graphs and linear cellular automata","volume":"5","author":"Sutner","year":"1991","journal-title":"Comp. Syst."},{"key":"10.1016\/j.ins.2019.10.068_bib0034","doi-asserted-by":"crossref","unstructured":"B. Wolnik, B. De Baets, All binary number-conserving cellular automata based on adjacent cells are intrinsically one-dimensional, Phys. Rev. E 100, 022126, https:\/\/doi.org\/10.1103\/PhysRevE.100.022126.","DOI":"10.1103\/PhysRevE.100.022126"},{"key":"10.1016\/j.ins.2019.10.068_bib0035","doi-asserted-by":"crossref","first-page":"435101","DOI":"10.1088\/1751-8121\/aa89cf","article-title":"Number-conserving cellular automata with a von Neumann neighborhood of range one","volume":"50","author":"Wolnik","year":"2017","journal-title":"J. Phys. A Math. Theor."},{"key":"10.1016\/j.ins.2019.10.068_bib0036","doi-asserted-by":"crossref","unstructured":"B. Wolnik, A. Nenca, J.M. Baetens, B. De Baets, A split-and-perturb decomposition of number-conserving cellular automata, 2019.arXiv:1901.05067","DOI":"10.1016\/j.physd.2020.132645"},{"key":"10.1016\/j.ins.2019.10.068_bib0037","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ins.2015.06.048","article-title":"Reversibility of general 1d linear cellular automata over the binary field Z2 under null boundary conditions","volume":"324","author":"Yang","year":"2015","journal-title":"Inf. Sci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025519310369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025519310369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:56:25Z","timestamp":1758084985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025519310369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":37,"alternative-id":["S0020025519310369"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2019.10.068","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ternary reversible number-conserving cellular automata are trivial","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2019.10.068","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}