AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
From MaRDI portal
Publication:4513304
DOI10.1142/S0218196799000230zbMath1040.68061MaRDI QIDQ4513304
Jacques Sakarovitch, Christiane Frougny
Publication date: 7 November 2000
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Algebraic theory of languages and automata (68Q70) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other number representations (11A67)
Related Items (8)
On multiplicatively dependent linear numeration systems, and periodic points ⋮ A quasi-ergodic approach to non-integer base expansions ⋮ Pisot numbers, primitive matrices and beta-conjugates ⋮ The golden mean as clock cycle of brain waves ⋮ TWO GROUPS ASSOCIATED WITH QUADRATIC PISOT UNITS ⋮ Ergodic properties of the Erdős measure, the entropy of the goldenshift, and related problems ⋮ On-line digit set conversion in real base. ⋮ An Exercise on Fibonacci Representations
Cites Work
- Synchronized rational relations of finite and infinite words
- How to write integers in a non-integral basis
- Finite beta-expansions
- Representations for real numbers and their ergodic properties
- On theβ-expansions of real numbers
- Representations of numbers and finite automata
- Computability by finite automata and pisot bases
- On Relations Defined by Generalized Finite Automata
- A machine realization of the linear context-free languages
This page was built for publication: AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION