On the Real-state Processing of Regular Operations and The Sakoda-Sipser Problem. - J. Andres Montoya; David Casas (CLEI Selected Papers, 2015)

Binary Completely Reachable Automata. - David Casas; Mikhail V. Volkov 001 (LATIN, 2022)

Completely reachable automata: an interplay between automata, graphs, and trees. - Evgeniya A. Bondar; David Casas; Mikhail V. Volkov 001 (CoRR, 2022)

Don's conjecture for binary completely reachable automata: an approach and its limitations. - David Casas; Mikhail V. Volkov 001 (CoRR, 2023)

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)