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

DOI10.1016/S0304-3975(97)00122-9MaRDI QIDQ1285569zbMATH OpenFDO

Authors Gilles Didier

Publication date 28 April 1999

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

Full work available at URL https://doi.org/10.1016/S0304-3975(97)00122-9

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Sequences with subword complexity \(2n\)
• *-Sturmian words and complexity
• Représentation géométrique de suites de complexité 2n+1

Cites work

• Complexity and special factors
• scientific article; zbMATH DE number 5051583 (Why is no real title available?)
• On the complexity of infinite sequences
• Représentation géométrique de suites de complexité 2n+1
• Substitution dynamical systems - spectral analysis
• Systems of finite rank
• Transcendence of numbers with a low complexity expansion

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285569)