Rewriting rules for arithmetics in alternate base systems

02/21/2023
by   Zuzana Masakova, et al.
0

For alternate Cantor real base numeration systems we generalize the result of Frougny and Solomyak on arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness property. The proof uses rewriting rules on the language of expansions in the corresponding numeration system. The proof is constructive and provides a method for performing addition of expansions in Cantor real bases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2021

Expansions in Cantor real bases

We introduce and study series expansions of real numbers with an arbitra...
research
02/08/2022

Spectrum, algebraicity and normalization in alternate bases

The first aim of this article is to give information about the algebraic...
research
03/10/2019

State complexity of the multiples of the Thue-Morse set

The Thue-Morse set is the set of those nonnegative integers whose binary...
research
06/01/2021

Insertion in constructed normal numbers

Defined by Borel, a real number is normal to an integer base b, greater ...
research
07/27/2018

Enumerating Cryptarithms Using Deterministic Finite Automata

A cryptarithm is a mathematical puzzle where given an arithmetic equatio...
research
02/17/2021

Dynamical behavior of alternate base expansions

We generalize the greedy and lazy β-transformations for a real base β to...
research
02/21/2021

Mining EL Bases with Adaptable Role Depth

In Formal Concept Analysis, a base for a finite structure is a set of im...

Please sign up or login with your details

Forgot password? Click here to reset