Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound
O Martynova, A Okhotin - … on Descriptional Complexity of Formal Systems, 2023 - Springer
The maximum length of the shortest string accepted by an n-state two-way finite automaton
is known to be at least of the order Ω (1. 626 n) and at most 2 nn+ 1= O (1 n 4 n). In this …
is known to be at least of the order Ω (1. 626 n) and at most 2 nn+ 1= O (1 n 4 n). In this …
The maximum length of shortest accepted strings for direction-determinate two-way finite automata
O Martynova, A Okhotin - arXiv preprint arXiv:2210.00235, 2022 - arxiv.org
It is shown that, for every $ n\geqslant 2$, the maximum length of the shortest string
accepted by an $ n $-state direction-determinate two-way finite automaton is exactly $\binom …
accepted by an $ n $-state direction-determinate two-way finite automaton is exactly $\binom …
[PDF][PDF] Minimal strings and graphs accepted by automata
MO Maksimovna - 2023 - dspace.spbu.ru
For different classical types of automata, the question, how large the minimal accepted
object can be, is investigated. The maximum length of the shortest string accepted by a two …
object can be, is investigated. The maximum length of the shortest string accepted by a two …