1 paper
Szilárd Zsolt Fazekas, Robert Mercaş
We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines hav…