Cyclic complexity of words
From MaRDI portal
Publication:507796
DOI10.1016/J.JCTA.2016.07.002zbMATH Open1369.68271OpenAlexW2171392767MaRDI QIDQ507796FDOQ507796
Authors: Julien Cassaigne, Gabriele Fici, M. Sciortino, Luca Q. Zamboni 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Characterisations of balanced words via orderings
- Abelian complexity of minimal subshifts
- Sturmian and Episturmian Words
- Some combinatorial properties of Sturmian words
- Words and forbidden factors
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
- Enumeration of factors in the Thue-Morse word
- Sequences with minimal block growth
- On an involution of Christoffel words and Sturmian morphisms
- Burrows-Wheeler transform and Sturmian words
- On Christoffel classes
- Cyclic Complexity of Words
- The number of factors in a paperfolding sequence
Cited In (32)
- A note on the Lie complexity and beyond
- Expansions of generalized Thue-Morse numbers
- Weighted prefix normal words: mind the gap
- On the character of words of sublinear complexity
- On overabundant words and their application to biological sequence analysis
- On a new notion of complexity on infinite words
- Cyclic Permutations of Letters of Words in Languages over an Alphabet
- Initial non-repetitive complexity of infinite words
- On the parity slope of words of low complexity
- Title not available (Why is that?)
- Open and closed factors in Arnoux-Rauzy words
- Abelian-square-rich words
- Cyclic Complexity of Words
- On subword complexity functions
- Partitioned factors in Christoffel and Sturmian words
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
- Binomial complexities and Parikh-collinear morphisms
- Factor complexity
- Characterizations of families of morphisms and words via binomial complexities
- The abelian complexity of infinite words and the Frobenius problem
- Properties of a class of Toeplitz words
- Topological invariants for words of linear factor complexity
- Words with minimal growth function
- Unique Subwords in Nonperiodic Words
- On the complexity functions of Sturmian words
- Title not available (Why is that?)
- A new complexity function for words based on periodicity
- On the Lie complexity of Sturmian words
- Lie complexity of words
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
- On a group theoretic generalization of the Morse-Hedlund theorem
This page was built for publication: Cyclic complexity of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507796)
