Palindromic and abelian complexities in binary recurrent words of ultimate complexity n + 2

zbMATH Open1256.68135MaRDI QIDQ4647906FDOQ4647906

Authors: Idrissa Kaboré 

Publication date: 8 November 2012

Recommendations

• Binary recurrent words of ultimate complexity \(n+2\)
• Ultimately constant abelian complexity of infinite words
• Recurrent words with constant abelian complexity
• Factor versus palindromic complexity of uniformly recurrent infinite words
• Abelian maximal pattern complexity of words

zbMATH Keywords

Parikh vectorspalindrome complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (6)

• Ultimately constant abelian complexity of infinite words
• A connection between palindromic and factor complexity using return words
• Binary recurrent words of ultimate complexity \(n+2\)
• On k-Abelian Palindromic Rich and Poor Words
• On binary palindromes of the form \(10^n\pm 1\)
• Recurrent words with constant abelian complexity

This page was built for publication: Palindromic and abelian complexities in binary recurrent words of ultimate complexity \(n + 2\)

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