Cyclic complexity of words
From MaRDI portal
Publication:507796
DOI10.1016/j.jcta.2016.07.002zbMath1369.68271OpenAlexW2171392767MaRDI QIDQ507796
Gabriele Fici, Luca Q. Zamboni, Julien Cassaigne, Marinella Sciortino
Publication date: 9 February 2017
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2016.07.002
Related Items (13)
Abelian-square-rich words ⋮ Weighted prefix normal words: mind the gap ⋮ Lie complexity of words ⋮ Binomial complexities and Parikh-collinear morphisms ⋮ Topological invariants for words of linear factor complexity ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ A note on the Lie complexity and beyond ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ Unnamed Item ⋮ On overabundant words and their application to biological sequence analysis ⋮ On the Lie complexity of Sturmian words ⋮ Expansions of generalized Thue-Morse numbers ⋮ On a group theoretic generalization of the Morse-Hedlund theorem
Cites Work
- Unnamed Item
- Burrows-Wheeler transform and Sturmian words
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Some combinatorial properties of Sturmian words
- Words and forbidden factors
- Enumeration of factors in the Thue-Morse word
- Characterisations of balanced words via orderings
- On an involution of Christoffel words and Sturmian morphisms
- Cyclic Complexity of Words
- Abelian complexity of minimal subshifts
- On Christoffel classes
- Sturmian and Episturmian Words
- The number of factors in a paperfolding sequence
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
- Sequences with minimal block growth
This page was built for publication: Cyclic complexity of words
