Robustness of Pisot-regular sequences

Abstract: We consider numeration systems based on a

d

-tuple

m a t h b f U = (U_{1}, l d o t s, U_{d})

of sequences of integers and we define

(m a t h b f U, m a t h b b K)

-regular sequences through

m a t h b b K

-recognizable formal series, where

m a t h b b K

is any semiring. We show that, for any

d

-tuple

m a t h b f U

of Pisot numeration systems and any commutative semiring

m a t h b b K

, this definition does not depend on the greediness of the

m a t h b f U

-representations of integers. The proof is constructive and is based on the fact that the normalization is realizable by a

2 d

-tape finite automaton. In particular, we use an ad hoc operation mixing a

2 d

-tape automaton and a

m a t h b b K

-automaton in order to obtain a new

m a t h b b K

-automaton.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Robustness of Pisot-regular sequences