Shortest Repetition-Free Words Accepted by Automata
Mousavi, Hamoon · Shallit, Jeffrey
Original · EN
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 shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.