Envelope Words and the Reflexivity of the Return Word Sequences in the Period-doubling Sequence

Publication date 21 March 2017

Automata sequences (11B85) Formal languages and automata (68Q45)

Abstract: We consider the infinite one-sided sequence over alphabet

a, b

generated by the period-doubling substitution

s i g m a (a) = a b

and

s i g m a (b) = a a

, denoted by

m a t h b b D

. Let

r_{p} (o m e g a)

be the

p

-th return word of factor

o m e g a

. The main result of this paper is twofold. (1) For any factor

o m e g a

in

m a t h b b D

, the return word sequence

{r_{p} (o m e g a)}_{p g e q 1}

is

T h e t a_{1}

or

T h e t a_{2}

. Both of them are substitutive sequences and determined completely in this paper. (2) For any factor

o m e g a

in

T h e t a_{1}

(resp.

T h e t a_{2}

), the return word sequence

{r_{p} (o m e g a)}_{p g e q 1}

is still

T h e t a_{1}

or

T h e t a_{2}

. We call it the reflexivity property of the return word sequence. As an application, we introduce a notion of spectrum for studying some typical combinatorial properties, such as separated, adjacent and overlapped.

This page was built for publication: Envelope Words and the Reflexivity of the Return Word Sequences in the Period-doubling Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284612)