{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T05:33:41Z","timestamp":1778909621011,"version":"3.51.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030625351","type":"print"},{"value":"9783030625368","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_9","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"104-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Longer Shortest Strings in Two-Way Finite Automata"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Krymski","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":[[2020,11,6]]},"reference":[{"key":"9_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":"9_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":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-030-24886-4_6","volume-title":"Developments in Language Theory","author":"E Dobronravov","year":"2019","unstructured":"Dobronravov, E., Dobronravov, N., Okhotin, A.: On the length of shortest strings accepted by two-way finite automata. In: Hofman, P., Skrzypczak, M. (eds.) DLT 2019. LNCS, vol. 11647, pp. 88\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24886-4_6"},{"key":"9_CR4","unstructured":"Dobronravov, E., Dobronravov, N., Okhotin, A.: On the length of shortest strings accepted by two-way finite automata, revised full version, submitted"},{"issue":"4","key":"9_CR5","first-page":"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. Automata Lang. Comb. 10(4), 407\u2013437 (2005)","journal-title":"J. Automata Lang. Comb."},{"key":"9_CR6","unstructured":"Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: NCMA 2013 (Ume\u00e5, vol. 13\u201314, Sweden, August 2013"},{"key":"9_CR7","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: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_47"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00224-013-9465-0","volume":"55","author":"CA Kapoutsis","year":"2014","unstructured":"Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55(2), 421\u2013447 (2014)","journal-title":"Theory Comput. Syst."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: FOCS 1977, pp. 254\u2013266 (1977). http:\/\/dx.doi.org\/10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"key":"9_CR10","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 2013","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). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_53"},{"issue":"2","key":"9_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). https:\/\/doi.org\/10.1016\/0304-3975(92)90269-L","journal-title":"Theor. Comput. Sci."},{"key":"9_CR12","unstructured":"Sloane, N.J.A. (ed.): The On-Line Encyclopedia of Integer Sequences, published electronically at https:\/\/oeis.org"}],"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-030-62536-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:47Z","timestamp":1741634567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}