Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel
Abstract:
Formulae are derived for the number of cyclic binary strings of length n in which no single 1 occurs between two zeros and no single 0 occurs between two ones, and for the number of cyclic binary strings without substrings of the form 000 and 111. This problem is motivated by a problem of genetic information processing.