The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity

DOI10.1016/S0304-3975(97)00122-9zbMath0913.68163MaRDI QIDQ1285569

Gilles Didier

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

Transcendence of Sturmian or morphic continued fractions ⋮ Coding with variable block maps ⋮ Abelian combinatorics on words: a survey ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Combinatoire de mots récurrents de complexitén+2 ⋮ Variable length local decoding and alignment-free sequence comparison ⋮ Complexity of injective piecewise contracting interval maps ⋮ The \(P(n)/n\)-function for bi-finite words ⋮ On low-complexity bi-infinite words and their factors

Cites Work

• Unnamed Item
• Substitution dynamical systems - spectral analysis
• Complexity and special factors
• On the complexity of infinite sequences
• Transcendence of numbers with a low complexity expansion
• Représentation géométrique de suites de complexité $2n+1$
• Systems of finite rank

This page was built for publication: The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity