A characterization of substitutive sequences using return words

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.

Keywords

Combinatorics, 68R15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/165400

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0807.3322
 http://arxiv.org/abs/0807.3322
 Discrete Mathematics 179 (1998) 89-101

Collections

arXiv