On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. - Semyon Petrov; Alexander Okhotin (LATA, 2021)

On the rank of the communication matrix for deterministic two-way finite automata. - Semyon Petrov; Fedor Petrov 001; Alexander Okhotin (CoRR, 2023)

On the transformation of two-way finite automata to unambiguous finite automata. - Semyon Petrov; Alexander Okhotin (Inf. Comput., 2023)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata. - Semyon Petrov; Alexander Okhotin (CoRR, 2024)

On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata. - Semyon Petrov; Alexander Okhotin (DLT, 2025)