An Exercise on Fibonacci Representations
From MaRDI portal
Publication:3147016
Cites work
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3267414 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- Closure under union and composition of iterated rational transductions
- Descriptions of the Characteristic Sequence of an Irrational
- Iteration of rational transductions
- Systems of Numeration
Cited in
(14)- EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
- Enumeration and decidable properties of automatic sequences
- The number of valid factorizations of Fibonacci prefixes
- Robbins and Ardila meet Berstel
- On Fibonacci partitions
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
- On the number of partitions of an integer in the \(m\)-bonacci base
- scientific article; zbMATH DE number 3267414 (Why is no real title available?)
- Sturmian numeration systems and decompositions to palindromes
- scientific article; zbMATH DE number 7646870 (Why is no real title available?)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- Calculating the numbers of representations and the Garsia entropy in linear numeration systems
- Redundance in the signed \(m\)-bonacci numeration system
- Integers with a maximal number of Fibonacci representations
This page was built for publication: An Exercise on Fibonacci Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147016)
