A Combinatorial Proof of S-adicity for Sequences with Linear Complexity - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Integers : Electronic Journal of Combinatorial Number Theory Year : 2013

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.

Dates and versions

lirmm-00797658 , version 1 (07-03-2013)

Identifiers

Cite

Julien Leroy, Gwenaël Richomme. A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers : Electronic Journal of Combinatorial Number Theory, 2013, 13, pp.article #A5. ⟨10.1515/9783110298161.50⟩. ⟨lirmm-00797658⟩
145 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More