A Fibonacci analogue of the two’s complement numeration system

DOI10.1051/ita/2023007arXiv2205.02574MaRDI QIDQ6186543

Sébastien Labbé, Jana Lepšová

Publication date: 2 February 2024

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.02574

zbMATH Keywords

Fibonaccinumeration systemtransducertwo's complement

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Easy multiplications. I: The realm of Kleene's theorem
• Linear numeration systems of order two
• Automatic sequences based on Parry or Bertrand numeration systems
• A numeration system for Fibonacci-like Wang shifts
• Efficient Algorithms for Zeckendorf Arithmetic
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Fibonacci representations and finite automata
• Representations for real numbers and their ergodic properties
• Systems of Numeration
• On-line finite automata for addition in some numeration systems
• Number representation and finite automata
• Representations for real numbers
• Representation of Natural Numbers as Sums of Generalised Fibonacci Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Fibonacci analogue of the two’s complement numeration system