{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:09:09Z","timestamp":1742933349988,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643088"},{"type":"electronic","value":"9783031643095"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_4","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"32-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cellular Automata: Communication Matters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9589-5833","authenticated-orcid":false,"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","volume":"26","author":"RV Book","year":"1974","unstructured":"Book, R.V.: Tally languages and complexity classes. Inform. Control 26, 186\u2013193 (1974)","journal-title":"Inform. Control"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/S0167-8191(97)00075-6","volume":"23","author":"T Buchholz","year":"1997","unstructured":"Buchholz, T., Kutrib, M.: Some relations between massively parallel arrays. Parallel Comput. 23, 1643\u20131662 (1997)","journal-title":"Parallel Comput."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s002360050123","volume":"35","author":"T Buchholz","year":"1998","unstructured":"Buchholz, T., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Inform. 35, 329\u2013352 (1998)","journal-title":"Acta Inform."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, 149\u2013158 (1986)","DOI":"10.1016\/0304-3975(86)90142-8"},{"key":"4_CR5","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach (1984)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw Hill (1966)","DOI":"10.1145\/321312.321318"},{"key":"4_CR7","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley (1978)"},{"key":"4_CR8","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","volume":"17","author":"OH Ibarra","year":"1970","unstructured":"Ibarra, O.H.: Simple matrix languages. Inform. Control 17, 359\u2013394 (1970)","journal-title":"Inform. Control"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","volume":"3","author":"OH Ibarra","year":"1974","unstructured":"Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inform. Process. Lett. 3, 25\u201328 (1974)","journal-title":"Inform. Process. Lett."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25, 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"4_CR12","first-page":"343","volume":"78","author":"A Klein","year":"2007","unstructured":"Klein, A., Kutrib, M.: Cellular devices and unary languages. Fund. Inform. 78, 343\u2013368 (2007)","journal-title":"Fund. Inform."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Kutrib, M.: Cellular automata and language theory. In: Meyers, R. (ed.) Encyclopedia of Complexity and System Science, pp. 800\u2013823. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-30440-3_54","DOI":"10.1007\/978-0-387-30440-3_54"},{"key":"4_CR14","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-0-387-34735-6_15","volume-title":"Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006","author":"M Kutrib","year":"2006","unstructured":"Kutrib, M., Malcher, A.: Fast cellular automata with restricted inter-cell communication: computational capacity. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) TCS 2006. IIFIP, vol. 209, pp. 151\u2013164. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/978-0-387-34735-6_15"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/11821069_55","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M Kutrib","year":"2006","unstructured":"Kutrib, M., Malcher, A.: Fast iterative arrays with restricted inter-cell communication: constructions and decidability. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 634\u2013645. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_55"},{"key":"4_CR16","unstructured":"Kutrib, M., Malcher, A.: Bounded languages meet cellular automata with sparse communication. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) Descriptional Complexity of Formal Systems (DCFS 2009), pp. 211\u2013222. Otto-von-Guericke-Universit\u00e4t Magdeburg (2009)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129626409000201","volume":"19","author":"M Kutrib","year":"2009","unstructured":"Kutrib, M., Malcher, A.: Computations and decidability of iterative arrays with restricted communication. Parallel Process. Lett. 19, 247\u2013264 (2009)","journal-title":"Parallel Process. Lett."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2009.09.015","volume":"252","author":"M Kutrib","year":"2009","unstructured":"Kutrib, M., Malcher, A.: On one-way one-bit $$O$$(one)-message cellular automata. Electron. Notes Theor. Comput. Sci. 252, 77\u201391 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"4_CR19","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, 3516\u20133526 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR20","first-page":"135","volume":"15","author":"M Kutrib","year":"2010","unstructured":"Kutrib, M., Malcher, A.: One-way cellular automata, bounded languages, and minimal communication. J. Autom. Lang. Comb. 15, 135\u2013153 (2010)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11047-020-09810-6","volume":"21","author":"M Kutrib","year":"2022","unstructured":"Kutrib, M., Malcher, A.: Iterative arrays with finite inter-cell communication. Nat. Comput. 21, 3\u201315 (2022)","journal-title":"Nat. Comput."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(98)00150-9","volume":"217","author":"J Mazoyer","year":"1999","unstructured":"Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theor. Comput. Sci. 217, 53\u201380 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"1976","DOI":"10.1137\/S009753979935431X","volume":"30","author":"C Mereghetti","year":"2001","unstructured":"Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput. 30, 1976\u20131992 (2001)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. Int. J. Found. Comput. Sci. 13, 145\u2013159 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR25","unstructured":"Seidel, S.R.: Language recognition and the synchronization of cellular automata. Tech. Rep. 79-02, Department of Computer Science, University of Iowa, Iowa City (1979)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0167-8191(00)00079-X","volume":"27","author":"H Umeo","year":"2001","unstructured":"Umeo, H.: Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton. Parallel Comput. 27, 587\u2013599 (2001)","journal-title":"Parallel Comput."},{"key":"4_CR27","first-page":"257","volume":"52","author":"H Umeo","year":"2002","unstructured":"Umeo, H., Kamikawa, N.: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fund. Inform. 52, 257\u2013275 (2002)","journal-title":"Fund. Inform."},{"key":"4_CR28","first-page":"421","volume":"58","author":"H Umeo","year":"2003","unstructured":"Umeo, H., Kamikawa, N.: Real-time generation of primes by a 1-bit-communication cellular automaton. Fund. Inform. 58, 421\u2013435 (2003)","journal-title":"Fund. Inform."},{"key":"4_CR29","first-page":"181","volume":"3","author":"R Vollmar","year":"1981","unstructured":"Vollmar, R.: On cellular automata with a finite number of state changes. Computing 3, 181\u2013191 (1981)","journal-title":"Computing"},{"key":"4_CR30","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 \u2018efficiency\u2019 of polyautomata. Int. J. Theoret. Phys. 21, 1007\u20131015 (1982)","journal-title":"Int. J. Theoret. Phys."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/10719839_41","volume-title":"LATIN 2000: Theoretical Informatics","author":"T Worsch","year":"2000","unstructured":"Worsch, T.: Linear time language recognition on cellular automata with restricted communication. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 417\u2013426. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_41"}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:02:07Z","timestamp":1719871327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}