On periodicity of generalized pseudostandard words (Q907249)

Summary: Generalized pseudostandard words were introduced by \textit{A. de Luca} and \textit{A. De Luca} [Theor. Comput. Sci. 362, No. 1--3, 282--300 (2006; Zbl 1101.68073)]. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated generalized pseudostandard words. In this paper we provide a necessary and sufficient condition for their periodicity over a binary and a ternary alphabet. More precisely, we describe how the directive bi-sequence of a generalized pseudostandard word has to look like in order to correspond to a periodic word. We state moreover a conjecture concerning a necessary and sufficient condition for periodicity over any alphabet.