Palindrome complexity bounds for primitive substitution sequences

We consider one-sided infinite words generated via iteration by primitive substitutions on finite alphabets and provide bounds on the palindrome complexity function as well as uniform bounds on the frequencies of palindromes in such words. As an application of these bounds, we prove that the strongly palindromic sequences in a primitive substitution dynamical system form a set of measure zero.