A new complexity function for words based on periodicity
From MaRDI portal
Recommendations
Cites work
- Automatic Sequences
- Characteristic Sturmian words are extremal for the critical factorization theorem
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- On the number of frames in binary words
- Periodes et repetitions des mots du monoide libre
- Some combinatorial properties of Sturmian words
Cited in
(18)- Symbolic analysis of finite words: the complexity function
- On the Lie complexity of Sturmian words
- A characterization of eventual periodicity
- Topological invariants for words of linear factor complexity
- Initial non-repetitive complexity of infinite words
- Cyclic Complexity of Words
- Words with unbounded periodicity complexity
- On a new notion of complexity on infinite words
- Relationally Periodic Sequences and Subword Complexity
- scientific article; zbMATH DE number 1992418 (Why is no real title available?)
- scientific article; zbMATH DE number 4197990 (Why is no real title available?)
- Factor complexity and abelian complexity for infinite arrays
- The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
- An Inequality for the Number of Periods in a Word
- On the complexity functions of Sturmian words
- Opacity complexity of automatic sequences: the general case
- The reflection complexity of sequences over finite alphabets
- Sequences of words defined by two-way transducers
This page was built for publication: A new complexity function for words based on periodicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842028)
