A characterization of substitutive sequences using return words

Simple item page
dc.creatorDurand, Fabien
dc.date2008-07-21
dc.date.accessioned2026-07-07T09:51:53Z
dc.date.available2026-07-07T09:51:53Z
dc.descriptionWe prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
dc.identifierhttps://arxiv.org/abs/0807.3322
dc.identifierhttp://arxiv.org/abs/0807.3322
dc.identifierDiscrete Mathematics 179 (1998) 89-101
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165400
dc.subjectCombinatorics
dc.subject68R15
dc.titleA characterization of substitutive sequences using return words
dc.typetext

Files

Collections

arXiv