Toeplitz sequences are constructed from periodic sequences with undetermined positions by successively filling these positions with the letters of other periodic sequences. In this talk we will consider  the class of so called simple Toeplitz sequences. We will describe combinatorial properties, such as the word complexity, of the subshifts that are associated with them. The relation between combinatorial properties of the coding sequences and the Boshernitzan condition will be also discussed.