In this paper, numeration systems defined by recurrent sequences are considered. We present a class of recurrences yielding numeration systems for which the words corresponding to greedy expressions for natural numbers are easily described. Those sequences, in turn, enumerate classes of words with forbidden substrings. (c) 2012 Elsevier Ltd. All rights reserved.