An Exercise on Fibonacci Representations

DOI10.1051/ita:2001127zbMath1005.68119OpenAlexW2166062191MaRDI QIDQ3147016

Jean Berstel

Publication date: 18 September 2002

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_6_491_0

zbMATH Keywords

Fibonacci base

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15) Other number representations (11A67)

Related Items (12)

On the number of partitions of an integer in the \(m\)-bonacci base ⋮ Robbins and Ardila meet Berstel ⋮ The number of valid factorizations of Fibonacci prefixes ⋮ Calculating the numbers of representations and the Garsia entropy in linear numeration systems ⋮ A General Approach to Proving Properties of Fibonacci Representations via Automata Theory ⋮ Unnamed Item ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Sturmian numeration systems and decompositions to palindromes ⋮ EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS ⋮ Integers with a maximal number of Fibonacci representations ⋮ On Fibonacci partitions

Cites Work

• Systems of Numeration
• Descriptions of the Characteristic Sequence of an Irrational
• Iteration of rational transductions
• AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
• Closure under union and composition of iterated rational transductions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Exercise on Fibonacci Representations