15 citations · 105 across the 64 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.FL2013★ 1 cited
Sets Represented as the Length-n Factors of a Word
Shuo Tan, Jeffrey Shallit
In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how…
cs.FL2013
Shortest Repetition-Free Words Accepted by Automata
Hamoon Mousavi, Jeffrey Shallit
We consider the following problem: given that a finite automaton of states accepts at least one -power-free (resp., overlap-free) word, what is the length of the shortes…