{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:35Z","timestamp":1759637555772,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68195-1_10","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"118-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Hardest Languages for One-Dimensional Cellular Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9071-4909","authenticated-orcid":false,"given":"Mikhail","family":"Mrykhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01768474","volume":"11","author":"J Autebert","year":"1977","unstructured":"Autebert, J.: Non-principalit\u00e9 du cylindre des langages \u00e0 compteur. Math. Syst. Theory 11, 157\u2013167 (1977)","journal-title":"Math. Syst. Theory"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01768473","volume":"11","author":"L Boasson","year":"1977","unstructured":"Boasson, L., Nivat, M.: Le cylindre des langages lin\u00e9aires. Math. Syst. Theory 11, 147\u2013155 (1977)","journal-title":"Math. Syst. Theory"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1051\/ita\/1984180403071","volume":"18","author":"W Bucher","year":"1984","unstructured":"Bucher, W., Culik, K.: On real time and linear time cellular automata. RAIRO Theor. Inform. Appl. 18(4), 307\u2013325 (1984)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"4","key":"10_CR4","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 Informatica 35(4), 329\u2013352 (1998)","journal-title":"Acta Informatica"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C Choffrut","year":"1984","unstructured":"Choffrut, C., Culik II, K.: On real-time cellular automata and trellis automata. Acta Informatica 21, 393\u2013407 (1984)","journal-title":"Acta Informatica"},{"key":"10_CR6","unstructured":"Culik II, K.: Variations of the firing squad problem and applications. Inf. Process. Lett. 30(3), 153\u2013157 (1989)"},{"issue":"3","key":"10_CR7","first-page":"241","volume":"13","author":"K Culik II","year":"1979","unstructured":"Culik II, K., Maurer, H.A.: On simple representations of language families. RAIRO Theor. Informatics Appl. 13(3), 241\u2013250 (1979)","journal-title":"RAIRO Theor. Informatics Appl."},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"SA Greibach","year":"1973","unstructured":"Greibach, S.A.: The hardest context-free language. SIAM J. Comput. 2(4), 304\u2013310 (1973)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0203009","volume":"3","author":"SA Greibach","year":"1974","unstructured":"Greibach, S.A.: Jump PDA\u2019s and hierarchies of deterministic context-free languages. SIAM J. Comput. 3(2), 111\u2013127 (1974)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(86)90018-1","volume":"15","author":"T Harju","year":"1986","unstructured":"Harju, T., Karhum\u00e4ki, J., Kleijn, H.C.M.: On morphic generation of regular languages. Discrete Appl. Math. 15(1), 55\u201360 (1986)","journal-title":"Discrete Appl. Math."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(88)90040-0","volume":"57","author":"OH Ibarra","year":"1988","unstructured":"Ibarra, O.H., Jiang, T.: Relating the power of cellular arrays to their closure properties. Theoret. Comput. Sci. 57, 225\u2013238 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"OH Ibarra","year":"1984","unstructured":"Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoret. Comput. Sci. 29, 123\u2013153 (1984)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10_CR13","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., Kim, S.M.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distrib. Comput. 2(2), 182\u2013218 (1985)","journal-title":"J. Parallel Distrib. Comput."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J Mazoyer","year":"1987","unstructured":"Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoret. Comput. Sci. 50, 183\u2013238 (1987)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10_CR15","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Comb. 6(4), 519\u2013535 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Inf. Comput. 194(1), 19\u201348 (2004)","journal-title":"Inf. Comput."},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2004004","volume":"38","author":"A Okhotin","year":"2004","unstructured":"Okhotin, A.: On the equivalence of linear conjunctive grammars and trellis automata. RAIRO Theor. Inform. Appl. 38(1), 69\u201388 (2004)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2\/3","key":"10_CR18","first-page":"365","volume":"9","author":"A Okhotin","year":"2004","unstructured":"Okhotin, A.: State complexity of linear conjunctive languages. J. Autom. Lang. Comb. 9(2\/3), 365\u2013381 (2004)","journal-title":"J. Autom. Lang. Comb."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-98654-8_4","volume-title":"Developments in Language Theory","author":"A Okhotin","year":"2018","unstructured":"Okhotin, A.: A tale of conjunctive grammars. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 36\u201359. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_4"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2018.11.001","volume":"266","author":"A Okhotin","year":"2019","unstructured":"Okhotin, A.: Hardest languages for conjunctive and Boolean grammars. Inf. Comput. 266, 1\u201318 (2019)","journal-title":"Inf. Comput."},{"issue":"3","key":"10_CR21","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(3), 233\u2013253 (1972)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1&2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V Terrier","year":"1995","unstructured":"Terrier, V.: On real time one-way cellular array. Theoret. Comput. Sci. 141(1&2), 331\u2013335 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"1&2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00111-5","volume":"156","author":"V Terrier","year":"1996","unstructured":"Terrier, V.: Language not recognizable in real time by one-way cellular automata. Theoret. Comput. Sci. 156(1&2), 281\u2013287 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"10_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2005.10.039","volume":"352","author":"V Terrier","year":"2006","unstructured":"Terrier, V.: Closure properties of cellular automata. Theoret. Comput. Sci. 352(1\u20133), 97\u2013107 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-92910-9_4","volume-title":"Handbook of Natural Computing","author":"V Terrier","year":"2012","unstructured":"Terrier, V.: Language recognition by cellular automata. In: Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 123\u2013158. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-92910-9_4"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.05.041","volume":"692","author":"V Terrier","year":"2017","unstructured":"Terrier, V.: Recognition of poly-slender context-free languages by trellis automata. Theoret. Comput. Sci. 692, 1\u201324 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(86)90025-9","volume":"15","author":"S Yu","year":"1986","unstructured":"Yu, S.: A property of real-time trellis automata. Discrete Appl. Math. 15(1), 117\u2013119 (1986)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:12:01Z","timestamp":1613952721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","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":"52","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":"26","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":"50% - 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":"4","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)"}}]}}