A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Generalized pseudostandard words were introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated generalized pseudostandard words. We present a counterexample to Conjecture 43 from a paper by Blondin Massé et al. that estimated the complexity of binary generalized pseudostandard words as C(n) ≤ 4n for all sufficiently large n. We conjecture that C(n)<6n for all n ∈ N.arXiv:1611.05482v1 fatcat:c7ahkjz5ynhk7e4zhx4fzrld6q