Now showing items 1-3 of 3
Shuffling and unshuffling
(Bulletin of the European Association for Theoretical Computer Science, 2012)
We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal ...
Binary Words Containing Infinitely Many Overlaps
(The Electronic Journal of Combinatorics, 2006-09-22)
We characterize the squares occurring in infinite overlap-free binary words and construct various α power-free binary words containing infinitely many overlaps.
Squares and overlaps in the Thue-Morse sequence and some variants
(EDP Sciences, 2006)
We consider the position and number of occurrences of squares in the Thue-Morse sequence, and show that the corresponding sequences are 2-regular. We also prove that changing any finite but nonzero number of bits in the ...