2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Hamoon Mousavi, Jeffrey Shallit
We consider the following problem: given that a finite automaton M of N states accepts at least one k-power-free (resp., overlap-free) word, what is the length of the shortes…