{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:27:15Z","timestamp":1742984835941,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_2","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"20-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity-Theoretic Aspects of Expanding Cellular Automata"],"prefix":"10.1007","author":[{"given":"Augusto","family":"Modanese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ic.2012.10.019","volume":"223","author":"P Arrighi","year":"2013","unstructured":"Arrighi, P., Dowek, G.: Causal graph dynamics. Inf. Comput. 223, 78\u201393 (2013)","journal-title":"Inf. Comput."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(91)90075-D","volume":"91","author":"SR Buss","year":"1991","unstructured":"Buss, S.R., Hay, L.: On truth-table reducibility to SAT. Inf. Comput. 91(1), 86\u2013102 (1991)","journal-title":"Inf. Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, Shaker Heights, Ohio, USA, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"2_CR4","unstructured":"Dantchev, S.S.: Dynamic neighbourhood cellular automata. In: Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22\u201324 September 2008, pp. 60\u201368 (2008)"},{"key":"2_CR5","unstructured":"Dubacq, J.-C.: Different kinds of neighborhood-varying cellular automata. Ma\u00eetrise\/honour bachelor degree, \u00c9cole normale superi\u00e9ure de Lyon (1994)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(85)90073-8","volume":"41","author":"OH Ibarra","year":"1985","unstructured":"Ibarra, O.H., et al.: Fast parallel language recognition by cellular automata. Theor. Comput. Sci. 41, 231\u2013246 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2_CR7","first-page":"503","volume":"1","author":"A Ilachinski","year":"1987","unstructured":"Ilachinski, A., Halpern, P.: Structurally dynamic cellular automata. Complex Syst. 1(3), 503\u2013527 (1987)","journal-title":"Complex Syst."},{"issue":"1\u20133","key":"2_CR8","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/0167-2789(90)90198-X","volume":"45","author":"S Kim","year":"1990","unstructured":"Kim, S., McCloskey, R.: A characterization of constant-time cellular automata computation. Physica D 45(1\u20133), 404\u2013419 (1990)","journal-title":"Physica D"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-0-387-30440-3_54","volume-title":"Encyclopedia of Complexity and Systems Science","author":"Martin Kutrib","year":"2009","unstructured":"Kutrib, M.: Cellular automata and language theory. In: Encyclopedia of Complexity and Systems Science, pp. 800\u2013823 (2009)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-662-47221-7_11","volume-title":"Cellular Automata and Discrete Complex Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Shrinking one-way cellular automata. In: Kari, J. (ed.) AUTOMATA 2015. LNCS, vol. 9099, pp. 141\u2013154. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47221-7_11"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01683260","volume":"10","author":"RE Ladner","year":"1976","unstructured":"Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Math. Syst. Theory 10, 19\u201332 (1976)","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"RE Ladner","year":"1975","unstructured":"Ladner, R.E., et al.: A comparison of polynomial time reducibilities. Theor. Comput. Sci. 1(2), 103\u2013123 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","unstructured":"Modanese, A.: Complexity-theoretical aspects of expanding cellular automata. Master\u2019s thesis, Karlsruhe Institute of Technology (2018)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Modanese, A.: Shrinking and expanding one-dimensional cellular automata. Bachelor\u2019s thesis, Karlsruhe Institute of Technology (2016)","DOI":"10.1007\/978-3-319-39300-1_13"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-39300-1_13","volume-title":"Cellular Automata and Discrete Complex Systems","author":"A Modanese","year":"2016","unstructured":"Modanese, A., Worsch, T.: Shrinking and expanding cellular automata. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 159\u2013169. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39300-1_13"},{"key":"2_CR16","volume-title":"Picture Languages","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Picture Languages. Academic Press, New York (1979)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/S0019-9958(81)90153-4","volume":"50","author":"A Rosenfeld","year":"1981","unstructured":"Rosenfeld, A., Wu, A.Y.: Reconfigurable cellular computers. Inf. Control 50(1), 60\u201384 (1981)","journal-title":"Inf. Control"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0255(83)90045-2","volume":"30","author":"A Rosenfeld","year":"1983","unstructured":"Rosenfeld, A., et al.: Fast language acceptance by shrinking cellular automata. Inf. Sci. 30(1), 47\u201353 (1983)","journal-title":"Inf. Sci."},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/321650.321652","volume":"18","author":"AR Smith III","year":"1971","unstructured":"Smith III, A.R.: Simple computation-universal cellular spaces. J. ACM 18(2), 339\u2013353 (1971)","journal-title":"J. ACM"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF00290736","volume":"19","author":"R Sommerhalder","year":"1983","unstructured":"Sommerhalder, R., van Westrhenen, S.C.: Parallel language recognition in constant time by cellular automata. Acta Inf. 19, 397\u2013407 (1983)","journal-title":"Acta Inf."},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0167-2789(02)00601-2","volume":"171","author":"K Tomita","year":"2002","unstructured":"Tomita, K., et al.: Graph automata: natural expression of self-reproduction. Phys. D: Nonlinear Phenom. 171(4), 197\u2013210 (2002)","journal-title":"Phys. D: Nonlinear Phenom."},{"issue":"5","key":"2_CR22","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"KW Wagner","year":"1990","unstructured":"Wagner, K.W.: Bounded query classes. SIAM J. Comput. 19(5), 833\u2013846 (1990)","journal-title":"SIAM J. Comput."}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:02:22Z","timestamp":1687132942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20981-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209803","9783030209810"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20981-0_2","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"}]}}