Sturmian words and constant additive complexity

zbMATH Open1329.68203MaRDI QIDQ5262049FDOQ5262049

Julian Sahasrabudhe

Publication date: 9 July 2015

Full work available at URL: http://www.emis.de/journals/INTEGERS/papers/p30/p30.Abstract.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Ultimately constant abelian complexity of infinite words
• On additive complexity of infinite words
• Recurrent words with constant abelian complexity
• On abelian and additive complexity in infinite words
• On a generalization of abelian equivalence and complexity of infinite words

zbMATH Keywords

Sturmian wordadditive complexityabelian complexityrecurrent wordParikh vector

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (5)

• *-Sturmian words and complexity
• The Frobenius problem for homomorphic embeddings of languages into the integers
• Sturmian words and overexponential codimension growth
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Sturmian words and constant additive complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262049)