On factors of synchronized sequences

Abstract: Let be an integer. A sequence of natural numbers is -synchronized if its graph is represented, in base , by a right-synchronized rational relation. We show that the factor complexity and the palindromic complexity of a -synchronized sequence are -regular sequences. We derive that the palindromic complexity of a -automatic sequence is -automatic. [ABSTRACT FROM AUTHOR]