Fibonacci representations and finite automata
From MaRDI portal
Publication:3204057
DOI10.1109/18.75263zbMATH Open0716.68067OpenAlexW2049878792MaRDI QIDQ3204057FDOQ3204057
Authors: Christiane Frougny 
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.75263
Recommendations
Formal languages and automata (68Q45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cited In (19)
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- A construction on finite automata that has remained hidden
- Title not available (Why is that?)
- A Fibonacci analogue of the two’s complement numeration system
- Combinatorial and probabilistic properties of systems of numeration
- Title not available (Why is that?)
- A class of adding machines and Julia sets
- On the complexity of Fibonacci coding
- Confluent linear numeration systems
- Associativity of recurrence multiplication
- Robbins and Ardila meet Berstel
- Généralisation de la multiplication de Fibonacci. (Generalization of the Fibonacci multiplication)
- Some combinatorics from Zeckendorf representations
- Deterministic synchronization of automata with bounded delay
- Number representation and finite automata
- Title not available (Why is that?)
- Numeration systems, linear recurrences, and regular sets
This page was built for publication: Fibonacci representations and finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204057)
