On the Length of Shortest Strings Accepted by Two-way Finite Automata
Given a two-way finite automaton recognizing a non-empty language, consider the length of the shortest string it accepts, and, for each n ≥ 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 Ω(10n/5) and less than (2nn+1), with the lower bound reached over an alphabet of size Θ(n). Furthermore, for deterministic automata and for a fixed alphabet of size m ≥ 1, the length of the shortest string is at least e(1+o(1))mn(log n− log m).
2014 ◽
Vol 25
(07)
◽
pp. 877-896
◽
Keyword(s):
2016 ◽
Vol 27
(05)
◽
pp. 557-577
◽
2018 ◽
Vol 52
(2-3-4)
◽
pp. 153-168
Keyword(s):
2018 ◽
Vol 29
(02)
◽
pp. 315-329
◽
2020 ◽
Vol 31
(04)
◽
pp. 527-538
2010 ◽
Vol 21
(05)
◽
pp. 843-858
◽
2005 ◽
Vol 16
(05)
◽
pp. 1027-1038
◽
2012 ◽
Vol 22
(03)
◽
pp. 1250020
Keyword(s):