{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:23Z","timestamp":1742914223681,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_6","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"77-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Iterative Arrays with Self-verifying Communication Cell"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Worsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Buchholz, Th., Klein, A., Kutrib, M.: Iterative arrays with limited nondeterministic communication cell. In: Words, Languages and Combinatorics III, pp. 73\u201387. World Scientific Publishing (2003)","DOI":"10.1142\/9789812704979_0006"},{"issue":"11","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/S0167-8191(97)00075-6","volume":"23","author":"Thomas Buchholz","year":"1997","unstructured":"Buchholz, Th., Kutrib, M.: Some relations between massively parallel arrays. Parallel Comput. 23, 1643\u20131662 (1997)","journal-title":"Parallel Computing"},{"key":"6_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, 349\u2013365 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(84)90043-4","volume":"32","author":"K \u010culik II","year":"1984","unstructured":"\u010culik II, K., Yu, S.: Iterative tree automata. Theoret. Comput. Sci. 32, 227\u2013247 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0023453","volume-title":"STACS 97","author":"P D\u030curi\u0161","year":"1997","unstructured":"D\u030curi\u0161, P., Hromkovi\u010d, J., Rolim, J.D.P., Schnitger, G.: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 117\u2013128. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023453"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"CR Dyer","year":"1980","unstructured":"Dyer, C.R.: One-way bounded cellular automata. Inf. Control 44, 261\u2013281 (1980)","journal-title":"Inf. Control"},{"key":"6_CR7","unstructured":"Fernau, H., Kutrib, M., Wendlandt, M.: Self-verifying pushdown automata. In: Non-Classical Models of Automata and Applications (NCMA 2017). books@ocg.at, vol. 329, pp. 103\u2013117. Austrian Computer Society, Vienna (2017)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ic.2010.11.017","volume":"209","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209, 528\u2013535 (2011)","journal-title":"Inf. Comput."},{"key":"6_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"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-0-387-30440-3","volume-title":"Encyclopedia of Complexity and System Science","author":"M Kutrib","year":"2009","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"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18812-6_1","volume-title":"Cellular Automata and Discrete Complex Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M.: Complexity of one-way cellular automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 3\u201318. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18812-6_1"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-99813-8_31","volume-title":"Cellular Automata","author":"M Kutrib","year":"2018","unstructured":"Kutrib, M., Worsch, T.: Self-verifying cellular automata. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 340\u2013351. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99813-8_31"},{"key":"6_CR13","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. Theoret. Comput. Sci. 217, 53\u201380 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0022-0000(72)80004-7","volume":"6","author":"AR Smith III","year":"1972","unstructured":"Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. Syst. Sci. 6, 233\u2013253 (1972)","journal-title":"J. Comput. Syst. Sci."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:02:27Z","timestamp":1687132947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20981-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209803","9783030209810"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20981-0_6","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"}]}}