Linear numeration systems of order two

DOI10.1016/0890-5401(88)90050-8zbMath0648.68066OpenAlexW1987087651MaRDI QIDQ1105378

Christiane Frougny

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

zbMATH Keywords

numeration systemsubsequential machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recurrences (11B37) Radix representation; digital problems (11A63)

Related Items (9)

Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Representations of numbers and finite automata ⋮ \(\beta\)-shift, numeration systems, and automata ⋮ Caractérisation results about $L$ codes ⋮ 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

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

This page was built for publication: Linear numeration systems of order two