Binary self-adding sequences and languages

We inroduce the self-adding sequences, the binary case, and their associated languages. These languages are neither context-free nor DOL languages, but the inclusion (implicitly, the equivalence) problem is decidable, as well as other problems. Results concerning the periodicity of the self-adding sequences are also presented.