Robustness of Pisot-regular sequences

by   Γ‰milie Charlier, et al.

We consider numeration systems based on a d-tuple 𝐔=(U_1,…,U_d) of sequences of integers and we define (𝐔,𝕂)-regular sequences through 𝕂-recognizable formal series, where 𝕂 is any semiring. We show that, for any d-tuple 𝐔 of Pisot numeration systems and any commutative semiring 𝕂, this definition does not depend on the greediness of the 𝐔-representations of integers. The proof is constructive and is based on the fact that the normalization is realizable by a 2d-tape finite automaton. In particular, we use an ad hoc operation mixing a 2d-tape automaton and a 𝕂-automaton in order to obtain a new 𝕂-automaton.



There are no comments yet.


page 1

page 2

page 3

page 4

βˆ™ 12/09/2020

Regular sequences and synchronized sequences in abstract numeration systems

The notion of b-regular sequences was generalized to abstract numeration...
βˆ™ 05/19/2020

Decidability and k-Regular Sequences

In this paper we consider a number of natural decision problems involvin...
βˆ™ 05/03/2019

Preservation of normality by non-oblivious group selection

We give two different proofs of the fact that non-oblivious selection vi...
βˆ™ 11/30/2021

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions

In this manuscript we present a detailed proof for undecidability of the...
βˆ™ 08/01/2005

Regularity of Position Sequences

A person is given a numbered sequence of positions on a sheet of paper. ...
βˆ™ 06/08/2017

Regular Boardgames

We present an initial version of Regular Boardgames general game descrip...
βˆ™ 01/11/2021

Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading

Definitions of new symbols merely abbreviate expressions in logical fram...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.