{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:37:02Z","timestamp":1743125822556,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209803"},{"type":"electronic","value":"9783030209810"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20981-0_3","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"35-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Iterative Arrays with Finite Inter-cell Communication"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-92675-9_2","volume-title":"Cellular Automata and Discrete Complex Systems","author":"O Carton","year":"2018","unstructured":"Carton, O., Guillon, B., Reiter, F.: Counter machines and distributed automata a story about exchanging space and time. In: Baetens, J.M., Kutrib, M. (eds.) AUTOMATA 2018. LNCS, vol. 10875, pp. 13\u201328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92675-9_2"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TC.1987.5009449","volume":"C\u201336","author":"JH Chang","year":"1987","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A.: Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput. C\u201336, 64\u201375 (1987)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C\u201318","author":"SN Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by $$n$$-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C\u201318(4), 349\u2013365 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"PC Fischer","year":"1965","unstructured":"Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. ACM 12, 388\u2013394 (1965)","journal-title":"J. ACM"},{"issue":"1","key":"3_CR5","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(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0743-7315(85)90034-6","volume":"2","author":"OH Ibarra","year":"1985","unstructured":"Ibarra, O.H., Palis, M.A.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distrib. Comput. 2, 182\u2013218 (1985)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(88)90163-6","volume":"57","author":"OH Ibarra","year":"1988","unstructured":"Ibarra, O.H., Palis, M.A.: Two-dimensional iterative arrays: characterizations and applications. Theor. Comput. Sci. 57, 47\u201386 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1080\/00029890.1991.11995778","volume":"98","author":"JP Jones","year":"1991","unstructured":"Jones, J.P., Matijasevi\u010d, Y.V.: Proof of recursive unsolvability of Hilbert\u2019s tenth problem. Am. Math. Mon. 98, 689\u2013709 (1991)","journal-title":"Am. Math. Mon."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-0-387-30440-3","volume-title":"Encyclopedia of Complexity and Systems Science","author":"M Kutrib","year":"2009","unstructured":"Kutrib, M.: Cellular automata and language theory. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 800\u2013823. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-0-387-30440-3"},{"issue":"2","key":"3_CR10","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(2), 247\u2013264 (2009)","journal-title":"Parallel Process. Lett."},{"key":"3_CR11","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}(1)$$-message cellular automata. Electr. Notes Theor. Comput. Sci. 252, 77\u201391 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"38\u201339","key":"3_CR12","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."},{"issue":"1\/2","key":"3_CR13","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(1\/2), 135\u2013153 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"30","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3917","DOI":"10.1016\/j.tcs.2011.02.026","volume":"412","author":"M Kutrib","year":"2011","unstructured":"Kutrib, M., Malcher, A.: Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30), 3917\u20133931 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-92675-9_8","volume-title":"Cellular Automata and Discrete Complex Systems","author":"A Malcher","year":"2018","unstructured":"Malcher, A.: Hierarchies and undecidability results for iterative arrays with sparse communication. In: Baetens, J.M., Kutrib, M. (eds.) AUTOMATA 2018. LNCS, vol. 10875, pp. 100\u2013112. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92675-9_8"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Matijasevi\u010d, Y.V.: On recursive unsolvability of Hilbert\u2019s tenth problem. In: Logic, Methodology and Philosophy of Science, IV (Proceedings of the Fourth International Congress, Bucharest, 1971), North-Holland, pp. 89\u2013110 (1973)","DOI":"10.1016\/S0049-237X(09)70352-0"},{"issue":"1","key":"3_CR17","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(1), 53\u201380 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR18","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. Fundam. Inf. 52, 257\u2013275 (2002)","journal-title":"Fundam. Inf."},{"key":"3_CR19","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. Fundam. Inf. 58, 421\u2013435 (2003)","journal-title":"Fundam. Inf."},{"key":"3_CR20","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","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20981-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:02:10Z","timestamp":1687132930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20981-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209803","9783030209810"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20981-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 May 2019","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":"Guadalajara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2019.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}