State complexity of halting, returning and reversible graph-walking automata. - Olga Martynova 001; Alexander Okhotin (CoRR, 2020)

State Complexity of Union and Intersection on Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (DCFS, 2021)

Lower Bounds for Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (STACS, 2021)

Homomorphisms on Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (CIAA, 2022)

The maximum length of shortest accepted strings for direction-determinate two-way finite automata. - Olga Martynova 001; Alexander Okhotin (CoRR, 2022)

Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2n Lower Bound. - Olga Martynova 001; Alexander Okhotin (DCFS, 2023)

A Time to Cast Away Stones. - Olga Martynova 001; Alexander Okhotin (CIAA, 2023)

State complexity of transforming graph-walking automata to halting, returning and reversible. - Olga Martynova 001; Alexander Okhotin (Inf. Comput., 2023)

Non-closure under complementation for unambiguous linear grammars. - Olga Martynova 001; Alexander Okhotin (Inf. Comput., 2023)

Homomorphisms and inverse homomorphisms on graph-walking automata. - Olga Martynova 001; Alexander Okhotin (Theor. Comput. Sci., 2023)

Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. - Olga Martynova 001 (CIAA, 2024)

Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. - Olga Martynova 001 (Inf. Comput., 2024)

Nondeterministic Tree-Walking Automata Are Not Closed Under Complementation. - Olga Martynova 001; Alexander Okhotin (ICALP, 2025)

From Regular Expressions to Deterministic Finite Automata: $2^{ frac{n}{2}+ sqrt{n}( log n)^{ varTheta (1)}}$ States Are Necessary and Sufficient. - Olga Martynova 001; Alexander Okhotin (CIAA, 2025)

From regular expressions to deterministic finite automata: $2n/2+√n(log n)Θ(1) states are necessary and sufficient. - Olga Martynova 001; Alexander Okhotin (CoRR, 2025)