On the character of words of sublinear complexity
From MaRDI portal
Publication:4581961
DOI10.4064/AA8577-3-2018zbMATH Open1408.68126OpenAlexW2884699188WikidataQ129464209 ScholiaQ129464209MaRDI QIDQ4581961FDOQ4581961
Authors: Luca Q. Zamboni 
Publication date: 21 August 2018
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa8577-3-2018
Recommendations
Cites Work
Cited In (28)
- Title not available (Why is that?)
- On the minimal complexity of infinite words
- On the parity slope of words of low complexity
- Asymptotic subword complexity
- Hereditary properties of words
- Title not available (Why is that?)
- 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
- Factor complexity
- Infinite words with linear subword 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
- A characterization of words of linear complexity
- Cyclic complexity of words
- Subword complexity and periodicity in two or more dimensions
- Sequences of low arithmetical complexity
- On non-repetitive complexity of Arnoux-Rauzy words
- The Maximal Subword Complexity of Quasiperiodic Infinite Words
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
