3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.FL2018
A Characterization of Completely Reachable Automata
Eugenija Bondar, Mikhail Volkov
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is c…
cs.FL2016★ 3 cited
Completely Reachable Automata
Evgenija Bondar, Mikhail Volkov
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the who…