  In this paper, we describe minimal string attractors (of size two) of
pseudopalindromic prefixes of standard complementary-symmetric Rote sequences.
Such a class of Rote sequences forms a subclass of binary generalized
pseudostandard sequences, i.e., of sequences obtained when iterating
palindromic and antipalindromic closures. When iterating only palindromic
closure, palindromic prefixes of standard Sturmian sequences are obtained and
their string attractors are of size two. However, already when iterating only
antipalindromic closure, antipalindromic prefixes of binary pseudostandard
sequences are obtained and we prove that the minimal string attractors are of
size three in this case. We conjecture that the pseudopalindromic prefixes of
any binary generalized pseudostandard sequence have a minimal string attractor
of size at most four.
