{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T21:42:31Z","timestamp":1773956551458,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,5,18]],"date-time":"2013-05-18T00:00:00Z","timestamp":1368835200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11047-013-9374-9","type":"journal-article","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T05:44:35Z","timestamp":1368769475000},"page":"323-337","source":"Crossref","is-referenced-by-count":27,"title":["Solving the parity problem in one-dimensional cellular automata"],"prefix":"10.1007","volume":"12","author":[{"given":"Heather","family":"Betel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro P. B.","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,18]]},"reference":[{"issue":"38\u201340","key":"9374_CR1","doi-asserted-by":"crossref","first-page":"3685","DOI":"10.1016\/j.tcs.2009.05.004","volume":"410","author":"L Acerbi","year":"2009","unstructured":"Acerbi L, Dennunzio A, Formenti E (2009) Conservation of some dynamical properties for operations on cellular automata. Theoret Comput Sci 410(38\u201340):3685\u20133693","journal-title":"Theoret Comput Sci"},{"key":"9374_CR2","unstructured":"Angluin D (1980) Local and global properties in networks of processors. In: Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science (STACS), p 82\u201393"},{"issue":"4","key":"9374_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin D, Aspnes J, Eisenstat D, Ruppert E (2007) The computational power of population protocols. Distrib Comput 20(4):279\u2013304","journal-title":"Distrib Comput"},{"issue":"8-10","key":"9374_CR4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.tcs.2010.11.006","volume":"412","author":"H Betel","year":"2011","unstructured":"Betel H, Flocchini P (2011) On the relationship between fuzzy and boolean cellular automata. Theoret Comput Sci 412(8-10):703\u2013713","journal-title":"Theoret Comput Sci"},{"key":"9374_CR5","doi-asserted-by":"crossref","unstructured":"Boccara N, Cheong K (1993) Automata network epidemic models. In Boccara N et al. (eds) Cellular automata and cooperative systems, vol. 396, Kluwer Academic, Dordrecht, p 29\u201344.","DOI":"10.1007\/978-94-011-1691-6_4"},{"issue":"2","key":"9374_CR6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.tcs.2004.06.008","volume":"325","author":"G Cattaneo","year":"2004","unstructured":"Cattaneo G, Dennunzio A, Margara L (2004) Solution of some conjectures about topological properties of linear cellular automata. Theoret Comput Sci 325(2):249\u2013271","journal-title":"Theoret Comput Sci"},{"key":"9374_CR7","unstructured":"Chaudhuri P, Chowdhury D, S SN, Chattopadhyay S (1997) Additive cellular automata: Theory and applications, vol. 1. IEEE Computer Society Press, Los Alamitos"},{"issue":"47\u201349","key":"9374_CR8","doi-asserted-by":"crossref","first-page":"4823","DOI":"10.1016\/j.tcs.2009.06.023","volume":"410","author":"A Dennunzio","year":"2009","unstructured":"Dennunzio A, Di Lena P, Formenti E, Margara L (2009) On the directional dynamics of additive cellular automata. Theoret Comput Sci 410(47\u201349):4823\u20134833","journal-title":"Theoret Comput Sci"},{"key":"9374_CR9","unstructured":"Fat\u00e8s, N (2011) Stochastic cellular automata solve the density classification problem with an arbitrary precision. In: Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science (STACS), p 284\u2013295"},{"issue":"3","key":"9374_CR10","doi-asserted-by":"crossref","first-page":"R2081","DOI":"10.1103\/PhysRevE.55.R2081","volume":"55","author":"H Fuk\u015b","year":"1997","unstructured":"Fuk\u015b H (1997) Solution of the density classification problem with two cellular automata rules. Phys Rev E 55(3):R2081\u2013R2084","journal-title":"Phys Rev E"},{"key":"9374_CR11","doi-asserted-by":"crossref","unstructured":"Griffeath D, Moore C (eds) (2003) New constructions in cellular automata, (Santa Fe institute Sstudies on the sciences of complexity). Oxford University Press, New York","DOI":"10.1093\/oso\/9780195137170.001.0001"},{"key":"9374_CR12","volume-title":"Neural networks and learning machines","author":"S Haykin","year":"2008","unstructured":"Haykin S (2008) Neural networks and learning machines. 3rd edn. Prentice Hall, Englewood Cliffs","edition":"3"},{"key":"9374_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2006","unstructured":"Hopcroft J, Motwani R, Ullman J (2006) Introduction to Automata Theory, Languages, and Computation. 3rd edn. Addison-Wesley, Reading","edition":"3"},{"key":"9374_CR14","volume-title":"Topological and Symbolic Dynamics","author":"P Kurka","year":"2003","unstructured":"Kurka P (2003) Topological and Symbolic Dynamics. vol 11, 3rd edn. IEEE Computer Society Press, Los Alamitos"},{"key":"9374_CR15","doi-asserted-by":"crossref","unstructured":"Langton CG (1986) Studying artificial life with cellular automata. In: Evolution, Games, and Learning. North Holland","DOI":"10.1016\/0167-2789(86)90237-X"},{"issue":"2","key":"9374_CR16","first-page":"026,702\/1","volume":"64","author":"K Lee","year":"2001","unstructured":"Lee K, Xu H, Chau H (2001) Parity problem with a cellular automaton solution. Phys Rev E 64(2):026,702\/1\u2013026,702\/4","journal-title":"Phys Rev E"},{"key":"9374_CR17","doi-asserted-by":"crossref","unstructured":"Lenzen C, Oswald Y, Wattenhofer R (2008) What can be approximated locally?: case study: dominating sets in planar graphs. In: Proc. 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), p 46\u201354","DOI":"10.1145\/1378533.1378540"},{"key":"9374_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.entcs.2009.09.017","volume":"252","author":"C Martins","year":"2009","unstructured":"Martins C, de Oliveira P (2009) Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem. Electron Notes Theoret Comput Sci 252:103\u2013119","journal-title":"Electron Notes Theoret Comput Sci"},{"issue":"1-3","key":"9374_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.neucom.2006.07.003","volume":"70","author":"P Oliveira de","year":"2006","unstructured":"de Oliveira P, Bortot J, Oliveira G (2006) The best currently known class of dynamically equivalent cellular automata rules for density classification. Neurocomputing 70(1-3):35\u201343","journal-title":"Neurocomputing"},{"key":"9374_CR20","doi-asserted-by":"crossref","unstructured":"Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM Monographs on discrete mathematics and applications","DOI":"10.1137\/1.9780898719772"},{"issue":"3","key":"9374_CR21","doi-asserted-by":"crossref","first-page":"3589","DOI":"10.1103\/PhysRevE.57.3589","volume":"57","author":"M Sipper","year":"1998","unstructured":"Sipper M (1998) Computing with cellular automata: Three cases for nonuniformity. Physical Review E 57(3):3589\u20133592","journal-title":"Phys Rev E"},{"key":"9374_CR22","unstructured":"Voorhees B (2009) Additive cellular automata. In: Meyers R (ed.) Encyclopedia of Complexity and Systems Science. Elsevier, New York, p 101, 17"},{"issue":"4","key":"9374_CR23","first-page":"289","volume":"3","author":"D Wolz","year":"2008","unstructured":"Wolz D, de Oliveira P (2008) Very effective evolutionary techniques for searching cellular automata rule spaces. J Cell Autom 3(4):289\u2013312","journal-title":"J Cell Autom"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-013-9374-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-013-9374-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-013-9374-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T07:35:03Z","timestamp":1645083303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-013-9374-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,18]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9374"],"URL":"https:\/\/doi.org\/10.1007\/s11047-013-9374-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,18]]}}}