1 citations · 2 across the 2 of their papers we have counts for
Showing cs.FLShow 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.FL2011★ 1 cited
The non-abelian squares are not context-free
Shuo Tan
Answering a recent question of Crochemore, we prove that the language of words that are not abelian squares is not context-free.