Ultimately constant abelian complexity of infinite words
From MaRDI portal
Publication:3589628
DOI10.25596/JALC-2009-255zbMATH Open1205.68274MaRDI QIDQ3589628FDOQ3589628
Authors: Aleksi Saarela 
Publication date: 20 September 2010
Recommendations
- Recurrent words with constant abelian complexity
- Sturmian words and constant additive complexity
- Palindromic and abelian complexities in binary recurrent words of ultimate complexity \(n + 2\)
- On a generalization of abelian equivalence and complexity of infinite words
- Abelian complexity and frequencies of letters in infinite words
Cited In (18)
- On balanced and abelian properties of circular words over a ternary alphabet
- Aperiodic two-dimensional words of small abelian complexity
- Abelian closures of infinite binary words
- Computing abelian complexity of binary uniform morphic words
- Title not available (Why is that?)
- Cyclic Complexity of Words
- Binary recurrent words of ultimate complexity \(n+2\)
- Minimal Complexities for Infinite Words Written with d Letters
- Sturmian words and constant additive complexity
- On a Class of 2-Balanced Sequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- 2-balanced sequences coding rectangle exchange transformation
- On additive complexity of infinite words
- On the \(k\)-abelian complexity of the Cantor sequence
- On a generalization of abelian equivalence and complexity of infinite words
- Palindromic and abelian complexities in binary recurrent words of ultimate complexity \(n + 2\)
- Abelian combinatorics on words: a survey
- Recurrent words with constant abelian complexity
This page was built for publication: Ultimately constant abelian complexity of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589628)
