{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T05:33:38Z","timestamp":1778909618323,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2021,6,30]]},"abstract":"<jats:p>Given a two-way finite automaton recognizing a non-empty language, consider the length of the shortest string it accepts, and, for each n \u2265 1, let f(n) be the maximum of these lengths over all n-state automata. It is proved that for n-state two-way finite automata, whether deterministic or nondeterministic, this number is at least \u03a9(10n\/5) and less than (2nn+1), with the lower bound reached over an alphabet of size \u0398(n). Furthermore, for deterministic automata and for a fixed alphabet of size m \u2265 1, the length of the shortest string is at least e(1+o(1))mn(log\u2009n\u2212\u2009log\u2009m).<\/jats:p>","DOI":"10.3233\/fi-2021-2044","type":"journal-article","created":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T04:40:51Z","timestamp":1625287251000},"page":"315-331","source":"Crossref","is-referenced-by-count":2,"title":["On the Length of Shortest Strings Accepted by Two-way Finite Automata"],"prefix":"10.1177","volume":"180","author":[{"given":"Egor","family":"Dobronravov","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, St. Petersburg State University, 7\/9 Universitetskaya nab., Saint Petersburg 199034, Russia. yegordobronravov@mail.ru, dobronravov1999@mail.ru, alexander.okhotin@spbu.ru"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikita","family":"Dobronravov","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, St. Petersburg State University, 7\/9 Universitetskaya nab., Saint Petersburg 199034, Russia. yegordobronravov@mail.ru, dobronravov1999@mail.ru, alexander.okhotin@spbu.ru"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, St. Petersburg State University, 7\/9 Universitetskaya nab., Saint Petersburg 199034, Russia. yegordobronravov@mail.ru, dobronravov1999@mail.ru, alexander.okhotin@spbu.ru"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2021-2044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:29Z","timestamp":1777444349000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2021-2044"}},"subtitle":[],"editor":[{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,6,30]]},"references-count":0,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2044","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,30]]}}}