• Suites à termes dans un a...

Treffer: Suites à termes dans un alphabet fini

Title:
Suites à termes dans un alphabet fini
Authors:
Rauzy, Gérard
Subject Terms:
Probabilistic theory: distribution modulo \(1\), metric theory of algorithms, 510.mathematics, number of words of length n, growth, Sturm sequences, solved and unsolved problems, sequence over a finite alphabet, Topological dynamics, Article
Document Type:
Fachzeitschrift Article
File Description:
application/xml; image/jpeg; application/pdf
Access URL:
https://zbmath.org/3871492
Accession Number:
edsair.dedup.wf.002..9c165d24de9c521dec11327e1e2b4fae
Database:
OpenAIRE

Weitere Informationen

Let \(u=(u_ n)\), \(n\in {\mathbb{N}}\), be a sequence over a finite alphabet A. Denote by p(n) the number of words of length n which appear in u. The paper discusses some solved and unsolved problems related to the growth of p(n), especially the cases \(p(n)=n+1\) (so-called Sturm sequences) and \(p(n)=2n+1\).