Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees - Eugenija A. Bondar; David Casas; Mikhail V. Volkov (Int. J. Found. Comput. Sci., 2023)

A Characterization of Completely Reachable Automata - Eugenija A. Bondar; Mikhail V. Volkov (Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, 2018)

A Characterization of Completely Reachable Automata - Eugenija A. Bondar; Mikhail V. Volkov (CoRR, 2018)

Completely Reachable Automata - Eugenija A. Bondar; Mikhail V. Volkov (Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings, 2016)

Completely Reachable Automata - Eugenija A. Bondar; Mikhail V. Volkov (CoRR, 2016)