{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:56:30Z","timestamp":1742925390323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319926742"},{"type":"electronic","value":"9783319926759"}],"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_9","type":"book-chapter","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T10:31:51Z","timestamp":1527157911000},"page":"113-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Construction of Some Nonautomatic Sequences by Cellular Automata"],"prefix":"10.1007","author":[{"given":"Ir\u00e8ne","family":"Marcovici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Stoll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Adrien","family":"Tahay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"issue":"9","key":"9_CR2","doi-asserted-by":"publisher","first-page":"4890","DOI":"10.1109\/TIT.2015.2456634","volume":"61","author":"SR Blackburn","year":"2015","unstructured":"Blackburn, S.R.: Non-overlapping codes. IEEE Trans. Inf. Theory 61(9), 4890\u20134894 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-1-4613-8928-6_22","volume-title":"The Collected Works of J. Richard B\u00fcchi","author":"J. Richakd B\u00fcchi","year":"1990","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. In: Mac Lane, S., Siefkes, D. (eds.) The Collected Works of J. Richard B\u00fcchi, pp. 398\u2013424. Springer, New York (1990)"},{"issue":"7","key":"9_CR4","doi-asserted-by":"publisher","first-page":"4668","DOI":"10.1109\/TIT.2013.2252952","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee, Y.M., Kiah, H.M., Purkayastha, P., Wang, C.: Cross-Bifix-Free codes within a constant factor of optimality. IEEE Trans. Inf. Theory 59(7), 4668\u20134674 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"30","key":"9_CR5","doi-asserted-by":"publisher","first-page":"3800","DOI":"10.1016\/j.tcs.2011.02.019","volume":"412","author":"M Delacourt","year":"2011","unstructured":"Delacourt, M., Poupet, V., Sablik, M., Theyssier, G.: Directional dynamics along arbitrary curves in cellular automata. Theor. Comput. Sci. 412(30), 3800\u20133821 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR6","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(3), 388\u2013394 (1965)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/TIT.1960.1057587","volume":"6","author":"EN Gilbert","year":"1960","unstructured":"Gilbert, E.N.: Synchronization of binary messages. IRE Trans. Inf. Theory 6(4), 470\u2013477 (1960)","journal-title":"IRE Trans. Inf. Theory"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BFb0029979","volume-title":"Mathematical Foundations of Computer Science 1997","author":"I Korec","year":"1997","unstructured":"Korec, I.: Real-time generation of primes by a one-dimensional cellular automaton with 11 states. In: Pr\u00edvara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 358\u2013367. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0029979"},{"issue":"4","key":"9_CR9","first-page":"88","volume":"6","author":"VI Levenshte\u012dn","year":"1970","unstructured":"Levenshte\u012dn, V.I.: The maximal number of words in codes without overlap. Problemy Peredachi Informatsii 6(4), 88\u201390 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(93)90165-P","volume":"119","author":"B Litow","year":"1993","unstructured":"Litow, B., Dumas, P.: Additive cellular automata and algebraic series. Theor. Comput. Sci. 119(2), 345\u2013354 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR11","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."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/321328.321337","volume":"13","author":"M Minsky","year":"1966","unstructured":"Minsky, M., Papert, S.: Unrecognizable sets of numbers. J. ACM 13(2), 281\u2013286 (1966)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/321186.321196","volume":"10","author":"RW Ritchie","year":"1963","unstructured":"Ritchie, R.W.: Finite automata and the set of squares. J. ACM 10(4), 528\u2013531 (1963)","journal-title":"J. ACM"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.aam.2014.10.002","volume":"63","author":"E Rowland","year":"2015","unstructured":"Rowland, E., Yassawi, R.: A characterization of $$p$$-automatic sequences as columns of linear cellular automata. Adv. Appl. Math. 63, 68\u201389 (2015)","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601\u2013644 (1983)","journal-title":"Rev. Mod. 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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:03:24Z","timestamp":1655251404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92675-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319926742","9783319926759"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92675-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}