We introduce the self-adding sequences, the binary case, and their ass
ociated languages. These languages are neither context-free nor D0L la
nguages, but the inclusion (implicitly, the equivalence) problem is de
cidable, as well as other problems. Results concerning the periodicity
of the self-adding sequences are also presented.