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.
Merola, F., DANIELE A., G. (2012). Numeration and Enumeration. EUROPEAN JOURNAL OF COMBINATORICS, 33(7), 1547-1556 [10.1016/j.ejc.2012.03.017].
Numeration and Enumeration
MEROLA, FRANCESCA;
2012-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
