1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.FL2023
Don's conjecture for binary completely reachable automata: an approach and its limitations
David Casas, Mikhail V. Volkov
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely re…
cs.FL2022
Binary completely reachable automata
David Casas, Mikhail V. Volkov
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of…
cs.FL2022★ 1 cited
Completely reachable automata: an interplay between automata, graphs, and trees
Evgeniya A. Bondar, David Casas, Mikhail V. Volkov
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely re…