| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424295 | European Journal of Combinatorics | 2012 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daniele A. Gewurz, Francesca Merola,