Linear numeration systems of order two
From MaRDI portal
Publication:1105378
DOI10.1016/0890-5401(88)90050-8zbMath0648.68066MaRDI QIDQ1105378
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90050-8
68Q45: Formal languages and automata
11B37: Recurrences
11A63: Radix representation; digital problems
Related Items
Numeration systems, linear recurrences, and regular sets, Linear numeration systems, θ-developments and finite automata, A Fibonacci analogue of the two’s complement numeration system, Bounded delay L codes, On number systems with finite degree of ambiguity, \(\beta\)-shift, numeration systems, and automata, Decision algorithms for Fibonacci-automatic Words, I: Basic results, Representations of numbers and finite automata, Caractérisation results about $L$ codes
Cites Work
- Bases and ambiguity of number systems
- Easy multiplications. I: The realm of Kleene's theorem
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Systems of Numeration
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item