An Exercise on Fibonacci Representations
RAIRO-Theor. Inf. Appl., 35 6 (2001) 491-498
Published online: 2002-07-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
Jeffrey Shallit and Sonja Linghui ShanElectronic Proceedings in Theoretical Computer Science 386 228 (2023)
https://doi.org/10.4204/EPTCS.386.18
On Fibonacci partitions
Sam Chow and Tom SlatteryJournal of Number Theory 225 310 (2021)
https://doi.org/10.1016/j.jnt.2021.02.010
Robbins and Ardila meet Berstel
Jeffrey ShallitInformation Processing Letters 167 106081 (2021)
https://doi.org/10.1016/j.ipl.2020.106081
The number of valid factorizations of Fibonacci prefixes
Pierre Bonardo, Anna E. Frid and Jeffrey ShallitTheoretical Computer Science 775 68 (2019)
https://doi.org/10.1016/j.tcs.2018.12.016
Sturmian numeration systems and decompositions to palindromes
Anna E. FridEuropean Journal of Combinatorics 71 202 (2018)
https://doi.org/10.1016/j.ejc.2018.04.003
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Julien Leroy, Michel Rigo and Manon StipulantiDiscrete Mathematics 340 (5) 862 (2017)
https://doi.org/10.1016/j.disc.2017.01.003
Fibonacci and Lucas Representations
Zai-Qiao Bai and Steven R. FinchThe Fibonacci Quarterly 54 (4) 319 (2016)
https://doi.org/10.1080/00150517.2016.12427799
Calculating the numbers of representations and the Garsia entropy in linear numeration systems
Marcia EdsonMonatshefte für Mathematik 169 (2) 161 (2013)
https://doi.org/10.1007/s00605-012-0397-6
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
ÉMILIE CHARLIER, NARAD RAMPERSAD and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 23 (05) 1035 (2012)
https://doi.org/10.1142/S0129054112400448
Developments in Language Theory
Émilie Charlier, Narad Rampersad and Jeffrey ShallitLecture Notes in Computer Science, Developments in Language Theory 6795 165 (2011)
https://doi.org/10.1007/978-3-642-22321-1_15
Integers with a maximal number of Fibonacci representations
Petra Kocábová, Zuzana Masáková and Edita PelantováRAIRO - Theoretical Informatics and Applications 39 (2) 343 (2005)
https://doi.org/10.1051/ita:2005022
EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
JACQUES JUSTIN and GIUSEPPE PIRILLOInternational Journal of Foundations of Computer Science 15 (02) 329 (2004)
https://doi.org/10.1142/S0129054104002455
On representations of positive integers in the Fibonacci base
Marcia Edson and Luca Q. ZamboniTheoretical Computer Science 326 (1-3) 241 (2004)
https://doi.org/10.1016/j.tcs.2004.06.025