48 citations · 205 across the 8 of their papers we have counts for
1 paper · 1 filter
Jörg Olschewski, Michael Ummels
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha…