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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barcucci, E., Bernini, A., Pinzani, R.: A gray code for a regular language. In: Ferrari, L., Vamvakari, M. (eds.) GASCom 2018, CEUR Workshop Proceedings, vol. 2113, pp. 87–93 (2018). http://ceur-ws.org/Vol-2113/
Barcucci, E., Rinaldi, S.: Some linear recurrences and their combinatorial interpretation by means of regular languages. Theoret. Comput. Sci. 255, 679–686 (2001)
Bernini, A., Bilotta, S., Pinzani, R., Sabri, A., Vajnovszki, V.: Gray code orders for \(q\)-ary words avoiding a given factor. Acta Inform. 52, 573–592 (2015)
Fraenkel, A.S.: Systems of numeration. Amer. Math. Monthly 92, 105–114 (1985)
Sloane, N.J.A.: The online encyclopedia of integer sequences (2003). http://oeis.org
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Barcucci, E., Bernini, A., Pinzani, R. (2021). Strings from Linear Recurrences: A Gray Code. In: Lecroq, T., Puzynina, S. (eds) Combinatorics on Words. WORDS 2021. Lecture Notes in Computer Science(), vol 12847. Springer, Cham. https://doi.org/10.1007/978-3-030-85088-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-85088-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85087-6
Online ISBN: 978-3-030-85088-3
eBook Packages: Computer ScienceComputer Science (R0)