A new estimate on complexity of binary generalized pseudostandard words
Dvorakova, Lubomira · Florian, Josef
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.