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

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

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