Do the Properties of an S-adic Representation Determine Factor Complexity? - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Integer Sequences Year : 2013

Do the Properties of an S-adic Representation Determine Factor Complexity?

Abstract

The S-adic conjecture postulates the existence of a condition C such that a sequence has linear complexity if and only if it is an S-adic sequence satisfying C for some finite set S of morphisms. We present an overview of the factor complexity of S-adic sequences and we give some examples that either illustrate some interesting properties, or that are counterexamples to what might seem to be a "good" condition C.
Fichier principal
Vignette du fichier
durand2.pdf (347.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-00797654 , version 1 (10-07-2018)

Identifiers

  • HAL Id : lirmm-00797654 , version 1

Cite

Fabien Durand, Julien Leroy, Gwenaël Richomme. Do the Properties of an S-adic Representation Determine Factor Complexity?. Journal of Integer Sequences, 2013, 16 (2), pp.Art 13.2.6. ⟨lirmm-00797654⟩
173 View
69 Download

Share

Gmail Mastodon Facebook X LinkedIn More