On the character of words of sublinear complexity
From MaRDI portal
Publication:4581961
Recommendations
Cites work
Cited in
(28)- scientific article; zbMATH DE number 2123422 (Why is no real title available?)
- scientific article; zbMATH DE number 3911741 (Why is no real title available?)
- On the minimal complexity of infinite words
- On the parity slope of words of low complexity
- Asymptotic subword complexity
- Hereditary properties of words
- scientific article; zbMATH DE number 1560303 (Why is no real title available?)
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- Partitioned factors in Christoffel and Sturmian words
- A lower bound for the arithmetical complexity of Sturmian words
- A note on the decidability of subword inequalities
- Subword complexity and decomposition of the set of factors
- Infinite words with linear subword complexity
- Factor complexity
- The subword complexity of a two-parameter family of sequences
- On the arithmetical complexity of Sturmian words
- Topological invariants for words of linear factor complexity
- Context-free complexity of finite languages
- Words with minimal growth function
- An isolated point in the Heinis spectrum
- Subword complexity and Laurent series
- Cyclic complexity of words
- A characterization of words of linear complexity
- Subword complexity and periodicity in two or more dimensions
- Sequences of low arithmetical complexity
- On non-repetitive complexity of Arnoux-Rauzy words
- scientific article; zbMATH DE number 5990082 (Why is no real title available?)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words
This page was built for publication: On the character of words of sublinear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581961)
