Linear numeration systems, θ-developments and finite automata

DOI10.1007/BFb0028980zbMath1498.11029OpenAlexW1563445605MaRDI QIDQ5096150

Christiane Frougny

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0028980

Mathematics Subject Classification ID

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

Related Items

Numeration systems, linear recurrences, and regular sets ⋮ Redundancy of minimal weight expansions in Pisot bases

Cites Work

• How to write integers in a non-integral basis
• Codeterministic automata on infinite words
• Systèmes codés. (Coded systems)
• Linear numeration systems of order two
• Confluent linear numeration systems
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear numeration systems, θ-developments and finite automata