{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:17Z","timestamp":1742914097174,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343254"},{"type":"electronic","value":"9783031343261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34326-1_10","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:04:23Z","timestamp":1687604663000},"page":"134-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Accepted Strings for\u00a0Two-Way Finite Automata: Approaching the\u00a0$$2^n$$ Lower Bound"],"prefix":"10.1007","author":[{"given":"Olga","family":"Martynova","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-22600-7_5","volume-title":"Descriptional Complexity of Formal Systems","author":"L Alpoge","year":"2011","unstructured":"Alpoge, L., Ang, T., Schaeffer, L., Shallit, J.: Decidability and shortest strings in formal languages. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 55\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22600-7_5"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-662-49630-5_27","volume-title":"Foundations of Software Science and Computation Structures","author":"D Chistikov","year":"2016","unstructured":"Chistikov, D., Czerwi\u0144ski, W., Hofman, P., Pilipczuk, M., Wehar, M.: Shortest paths in one-counter systems. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 462\u2013478. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_27"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Dobronravov, E., Dobronravov, N., Okhotin, A.: On the length of shortest strings accepted by two-way finite automata. Fundam. Informaticae 180(4), 315-331 (2021). https:\/\/doi.org\/10.3233\/FI-2021-2044","DOI":"10.3233\/FI-2021-2044"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Automata Lang. Comb. 10(4), 407-437 (2005). https:\/\/doi.org\/10.25596\/jalc-2005-407","DOI":"10.25596\/jalc-2005-407"},{"key":"10_CR5","unstructured":"Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: Proceedings of Non-Classical Models for Automata and Applications (NCMA 2013) Ume\u00e5, Sweden, 13\u201314 August 2013"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.: Removing bidirectionality from nondeterministic finite automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_47"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proceedings og 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pp. 254-266 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-030-62536-8_9","volume-title":"Descriptional Complexity of Formal Systems","author":"S Krymski","year":"2020","unstructured":"Krymski, S., Okhotin, A.: Longer shortest strings in two-way finite automata. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 104\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_9"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. Inf. Comput. 275, 104631 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104631","DOI":"10.1016\/j.ic.2020.104631"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Pierre, L.: Rational indexes of generators of the cone of context-free languages. Theor. Comput. Sci. 95(2), 279-305 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90269-L","DOI":"10.1016\/0304-3975(92)90269-L"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Shemetova, E.N., Okhotin, A., Grigorev, S.V.: Rational index of languages with bounded dimension of parse trees. In: Proceedings of Developments in Language Theory (DLT 2022), pp. 263-273 (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_21","DOI":"10.1007\/978-3-031-05578-2_21"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34326-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:06:20Z","timestamp":1687604780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34326-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343254","9783031343261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34326-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","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":"dcfs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.uni-potsdam.de\/dcfs2023\/","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":"16","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":"14","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":"88% - 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":"2.35","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)"}}]}}