{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:58Z","timestamp":1740099478356,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_6","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Length of Shortest Strings Accepted by Two-Way Finite Automata"],"prefix":"10.1007","author":[{"given":"Egor","family":"Dobronravov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikita","family":"Dobronravov","sequence":"additional","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":[[2019,7,10]]},"reference":[{"key":"6_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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22600-7_5"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Czerwinski, 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. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49630-5_27"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, pp. 149\u2013158 (1986). \n                      https:\/\/doi.org\/10.1016\/0304-3975(86)90142-8\n                      \n                    . Errata: vol. 302, pp. 497\u2013498 (2003).\n                      https:\/\/doi.org\/10.1016\/S0304-3975(03)00136-1","DOI":"10.1016\/0304-3975(86)90142-8"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.25596\/jalc-2005-407","volume":"10","author":"K Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005). \n                      https:\/\/doi.org\/10.25596\/jalc-2005-407","journal-title":"J. Autom. Lang. Comb."},{"issue":"1\u20133","key":"6_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","volume":"295","author":"V Geffert","year":"2003","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295(1\u20133), 189\u2013203 (2003). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(02)00403-6","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","unstructured":"Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: NCMA 2013, Ume\u00e5, Sweden, 13\u201314 August 2013"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science","author":"CA Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.A.: Removing bidirectionality from nondeterministic finite automata. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11549345_47"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22321-1_28","volume-title":"Developments in Language Theory","author":"M Kunc","year":"2011","unstructured":"Kunc, M., Okhotin, A.: Describing periodicity in two-way deterministic finite automata using transformation semigroups. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22321-1_28"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-40313-2_53","volume-title":"Mathematical Foundations of Computer Science","author":"M Kunc","year":"2013","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 595\u2013606. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40313-2_53"},{"issue":"5","key":"6_CR10","first-page":"92","volume":"3","author":"E Landau","year":"1903","unstructured":"Landau, E.: \u00dcber die Maximalordnung der Permutationen gegebenen Grades (On the maximal order of permutations of a given degree). Archiv der Mathematik und Physik, Ser. 3(5), 92\u2013103 (1903)","journal-title":"Archiv der Mathematik und Physik, Ser."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(92)90269-L","volume":"95","author":"L Pierre","year":"1992","unstructured":"Pierre, L.: Rational indexes of generators of the cone of context-free languages. Theor. Comput. Sci. 95(2), 279\u2013305 (1992). \n                      https:\/\/doi.org\/10.1016\/0304-3975(92)90269-L","journal-title":"Theor. Comput. Sci."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Sipser, M.: Lower bounds on the size of sweeping automata. In: STOC, pp. 360\u2013364 (1979). \n                      https:\/\/doi.org\/10.1145\/800135.804429","DOI":"10.1145\/800135.804429"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:03:57Z","timestamp":1563908637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_6","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":"10 July 2019","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":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"67% - 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","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)"}}]}}