An Exercise on Fibonacci Representations
From MaRDI portal
Publication:3147016
DOI10.1051/ITA:2001127zbMATH Open1005.68119OpenAlexW2166062191MaRDI QIDQ3147016FDOQ3147016
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
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Other number representations (11A67)
Cites Work
- Title not available (Why is that?)
- Systems of Numeration
- Descriptions of the Characteristic Sequence of an Irrational
- Title not available (Why is that?)
- Title not available (Why is that?)
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- Iteration of rational transductions
- Title not available (Why is that?)
- Closure under union and composition of iterated rational transductions
Cited In (14)
- The number of valid factorizations of Fibonacci prefixes
- Title not available (Why is that?)
- On the number of partitions of an integer in the \(m\)-bonacci base
- On Fibonacci partitions
- Title not available (Why is that?)
- Robbins and Ardila meet Berstel
- EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
- Title not available (Why is that?)
- 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
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Integers with a maximal number of Fibonacci representations
- Sturmian numeration systems and decompositions to palindromes
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)
