{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:50Z","timestamp":1759638050621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-81508-0_25","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"304-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Hardest LL(k) Language"],"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,8,6]]},"reference":[{"key":"25_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":"25_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"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Culik, K. II, Maurer, H.A.: On simple representations of language families. RAIRO Theor. Informatics Appl. 13(3), 241\u2013250 (1979)","DOI":"10.1051\/ita\/1979130302411"},{"issue":"4","key":"25_CR4","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":"25_CR5","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."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: 7th Annual Symposium on Switching and Automata Theory, Berkeley, California, USA, 23\u201325 October 1966, pp. 36\u201346. IEEE Computer Society (1966)","DOI":"10.1109\/SWAT.1966.22"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01946814","volume":"9","author":"R Kurki-Suonio","year":"1969","unstructured":"Kurki-Suonio, R.: Notes on top-down languages. BIT Numer. Math. 9(3), 225\u2013238 (1969)","journal-title":"BIT Numer. Math."},{"issue":"7","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1142\/S0129054113400303","volume":"24","author":"T Lehtinen","year":"2013","unstructured":"Lehtinen, T., Okhotin, A.: Homomorphisms preserving deterministic context-free languages. Int. J. Found. Comput. Sci. 24(7), 1049\u20131066 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-030-68195-1_10","volume-title":"Language and Automata Theory and Applications","author":"M Mrykhin","year":"2021","unstructured":"Mrykhin, M., Okhotin, A.: On hardest languages for one-dimensional cellular automata. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 118\u2013130. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_10"},{"issue":"4","key":"25_CR10","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":"25_CR11","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."},{"key":"25_CR12","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":"25_CR13","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":"25_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"DJ Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Inf. Control. 17(3), 226\u2013256 (1970)","journal-title":"Inf. Control."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81508-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:35:19Z","timestamp":1628206519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_25","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":"6 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","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":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"56% - 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":"6","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)"}}]}}