Ostrowski numeration systems, addition, and finite automata

DOI10.1215/00294527-2017-0027zbMath1431.11017arXiv1407.7000OpenAlexW2263718452MaRDI QIDQ1750300

Alonza jun. Terry, Philipp Hieronymi

Publication date: 18 May 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

decidabilityadditionfinite automatacontinued fractionOstrowski numeration systemexpansion of Presburger arithmetic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Decidability of theories and sets of sentences (03B25) Continued fractions (11A55) Other number representations (11A67)

Related Items (4)

Critical exponents of infinite balanced words ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Unnamed Item

Cites Work

• The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
• Logic and \(p\)-recognizable sets of integers
• Numeration systems, linear recurrences, and regular sets
• Bertrand numeration systems and recognizability
• \(\beta\)-shift, numeration systems, and automata
• Efficient Algorithms for Zeckendorf Arithmetic
• Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
• EXPANSIONS OF THE ORDERED ADDITIVE GROUP OF REAL NUMBERS BY TWO DISCRETE SUBGROUPS
• Weak Second‐Order Arithmetic and Finite Automata
• Representations of numbers and finite automata
• Automatic Sequences
• Automata theory and its applications
• On the numeration system of Ostrowski
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ostrowski numeration systems, addition, and finite automata