Each strictly increasing sequence of positive integers can be used to define a numeration system so that any non-negative integer can be represented by a suitable and unique string of digits. We consider sequences defined by a two termed linear recurrence with constant coefficients having some particular properties and investigate on the possibility to define a Gray code for the set of the strings arising from them.
Strings from Linear Recurrences: A Gray Code / Barcucci E.; Bernini A.; Pinzani R.. - STAMPA. - 12847:(2021), pp. 40-49. (Intervento presentato al convegno 13th International Conference on Combinatorics on Words, WORDS 2021 tenutosi a Rouen (Francia) nel 13- 17 Settembre 2021) [10.1007/978-3-030-85088-3_4].
Strings from Linear Recurrences: A Gray Code
Barcucci E.
;Bernini A.
;Pinzani R.
2021
Abstract
Each strictly increasing sequence of positive integers can be used to define a numeration system so that any non-negative integer can be represented by a suitable and unique string of digits. We consider sequences defined by a two termed linear recurrence with constant coefficients having some particular properties and investigate on the possibility to define a Gray code for the set of the strings arising from them.File | Dimensione | Formato | |
---|---|---|---|
Proof_Author_da_LNCS_WORDS2021.pdf
Accesso chiuso
Descrizione: Author Proof
Tipologia:
Altro
Licenza:
Tutti i diritti riservati
Dimensione
312.07 kB
Formato
Adobe PDF
|
312.07 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.