Olga Martynova
Orcid: 0000-0002-1249-5173Affiliations:
- St. Petersburg State University, Russia
According to our database1,
Olga Martynova
authored at least 12 papers
between 2020 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.
Inf. Comput., January, 2024
Proceedings of the Implementation and Application of Automata, 2024
2023
Theor. Comput. Sci., November, 2023
Inf. Comput., June, 2023
State complexity of transforming graph-walking automata to halting, returning and reversible.
Inf. Comput., March, 2023
Proceedings of the Implementation and Application of Automata, 2023
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2<sup>n</sup> Lower Bound.
Proceedings of the Descriptional Complexity of Formal Systems, 2023
2022
The maximum length of shortest accepted strings for direction-determinate two-way finite automata.
CoRR, 2022
Proceedings of the Implementation and Application of Automata, 2022
2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the Descriptional Complexity of Formal Systems, 2021
2020
CoRR, 2020