Fibonacci representations and finite automata
From MaRDI portal
Publication:3204057
Recommendations
Cited in
(19)- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- A construction on finite automata that has remained hidden
- scientific article; zbMATH DE number 493646 (Why is no real title available?)
- A Fibonacci analogue of the two’s complement numeration system
- Combinatorial and probabilistic properties of systems of numeration
- A class of adding machines and Julia sets
- scientific article; zbMATH DE number 3986648 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3875155 (Why is no real title available?)
- 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)