{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:25:45Z","timestamp":1780050345433,"version":"3.53.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319926742","type":"print"},{"value":"9783319926759","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92675-9_2","type":"book-chapter","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T10:31:51Z","timestamp":1527157911000},"page":"13-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Counter Machines and Distributed Automata"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Guillon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: LICS 2013, pp. 13\u201322. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.65"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C Dyer","year":"1980","unstructured":"Dyer, C.: One-way bounded cellular automata. Inf. Control 44(3), 261\u2013281 (1980)","journal-title":"Inf. Control"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0898-1221(79)90042-7","volume":"5","author":"P Dymond","year":"1979","unstructured":"Dymond, P.: Indirect addressing and the time relationships of some models of sequential computation. Comput. Math. Appl. 5(3), 193\u2013209 (1979)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01694011","volume":"2","author":"P Fischer","year":"1968","unstructured":"Fischer, P., Meyer, A., Rosenberg, A.: Counter machines and counter languages. Math. Syst. Theor. 2(3), 265\u2013283 (1968)","journal-title":"Math. Syst. Theor."},{"key":"2_CR5","unstructured":"Goles, E., Ollinger, N., Theyssier, G.: Introducing freezing cellular automata. In: Cellular Automata and Discrete Complex Systems, Turku, Finland. TUCS Lecture Notes, vol. 24, pp. 65\u201373, June 2015. hal-id: hal-01294144"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00446-013-0202-3","volume":"28","author":"L Hella","year":"2015","unstructured":"Hella, L., J\u00e4rvisalo, M., Kuusisto, A., Laurinharju, J., Lempi\u00e4inen, T., Luosto, K., Suomela, J., Virtema, J.: Weak models of distributed computing, with connections to modal logic. Distrib. Comput. 28(1), 31\u201353 (2015)","journal-title":"Distrib. Comput."},{"key":"2_CR7","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"issue":"1\u20133","key":"2_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334(1\u20133), 3\u201333 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR9","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-78291-9_6","volume-title":"New Developments in Formal Languages and Applications","author":"M Kutrib","year":"2008","unstructured":"Kutrib, M.: Cellular automata - a computational point of view. In: Bel-Enguix, G., Jim\u00e9nez-L\u00f3pez, M.D., Mart\u00edn-Vide, C. (eds.) New Developments in Formal Languages and Applications. SCI, vol. 113, pp. 183\u2013227. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78291-9_6"},{"issue":"38\u201339","key":"2_CR10","doi-asserted-by":"publisher","first-page":"3516","DOI":"10.1016\/j.tcs.2010.05.024","volume":"411","author":"M Kutrib","year":"2010","unstructured":"Kutrib, M., Malcher, A.: Cellular automata with sparse communication. Theor. Comput. Sci. 411(38\u201339), 3516\u20133526 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","unstructured":"Kuusisto, A.: Modal logic and distributed message passing automata. In: CSL 2013. LIPIcs, vol. 23, pp. 452\u2013468 (2013)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.4204\/EPTCS.256.15","volume":"256","author":"Antti Kuusisto","year":"2017","unstructured":"Kuusisto, A., Reiter, F.: Emptiness problems for distributed automata. In: GandALF 2017. EPTCS, vol. 256, pp. 210\u2013222 (2017)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR13","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"4","key":"2_CR14","first-page":"549","volume":"7","author":"A Malcher","year":"2002","unstructured":"Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom. Lang. Comb. 7(4), 549\u2013560 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of post\u2019s problem of \u201ctag\u201d and other topics in theory of turing machines. Ann. Math. 74(3), 437\u2013455 (1961)","journal-title":"Ann. Math."},{"key":"2_CR16","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, vol. 5. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2000)"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S0129054111008106","volume":"22","author":"H Petersen","year":"2011","unstructured":"Petersen, H.: Simulations by time-bounded counter machines. Int. J. Found. Comput. Sci. 22(2), 395\u2013409 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR18","unstructured":"Reiter, F.: Asynchronous distributed automata: a characterization of the modal mu-fragment. In: ICALP 2017. LIPIcs, vol. 80, pp. 100:1\u2013100:14 (2017)"},{"key":"2_CR19","unstructured":"Seidel, S.: Language recognition and the synchronization of cellular automata. Technical report 79\u201302, Department of Computer Science, University of Iowa (1979)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-92910-9_4","volume-title":"Handbook of Natural Computing","author":"V Terrier","year":"2012","unstructured":"Terrier, V.: Language recognition by cellular automata. In: Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 123\u2013158. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-92910-9_4"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-7091-8596-4_13","volume-title":"Parallel Processes and Related Automata","author":"R Vollmar","year":"1981","unstructured":"Vollmar, R.: On cellular automata with a finite number of state changes. In: Kn\u00f6del, W., Schneider, H.J. (eds.) Parallel Processes and Related Automata, vol. 3, pp. 181\u2013191. Springer, Vienna (1981). https:\/\/doi.org\/10.1007\/978-3-7091-8596-4_13"},{"issue":"12","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/BF02084165","volume":"21","author":"R Vollmar","year":"1982","unstructured":"Vollmar, R.: Some remarks about the \u201cefficiency\u201d of polyautomata. Int. J. Theor. Phys. 21(12), 1007\u20131015 (1982)","journal-title":"Int. J. Theor. Phys."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92675-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:03:17Z","timestamp":1655251397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92675-9_2"}},"subtitle":["A Story About Exchanging Space and Time"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319926742","9783319926759"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92675-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.automata2018.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}