6 citations · 6 across the 3 of their papers we have counts for
1 paper · 1 filter
Robert Ferens, Marek Szykuła
A complete deterministic finite (semi)automaton (DFA) with a set of states Q is \emph{completely reachable} if every nonempty subset of Q is the image of the action of some wor…