Skip to Main content Skip to Navigation
Journal articles

A Combinatorial Proof of S-adicity for Sequences with Linear Complexity

Abstract : Using Rauzy graphs, Ferenczi proved that if a symbolic dynamical system has linear complexity then it is S-adic. Being more specific, the result can also be proved for infinite words. We provide a new proof of this latter result using the notion of return words to a set of words.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00797658
Contributor : Gwenaël Richomme <>
Submitted on : Thursday, March 7, 2013 - 8:36:01 AM
Last modification on : Tuesday, June 2, 2020 - 7:08:03 PM

Identifiers

  • HAL Id : lirmm-00797658, version 1

Citation

Julien Leroy, Gwenaël Richomme. A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2013, 13, pp.article #A5. ⟨lirmm-00797658⟩

Share

Metrics

Record views

282