The above program, using a word of length 2n, in which each letter occurs twice, builds a graph whose number of connectivity components is equal to the number of edge circles of the disk with unrolled ribbons corresponding to this word
A word of length 2n in which each letter occurs twice.
The number of edge circles of the disk with unrolled ribbons corresponding to this word.