Commutative polynomial automata series

A series $f : \Sigma^* \to \mathbb Q$ is commutative if the output does not depend on the order of the symbols in the input. Given a polynomial automaton recognising a commutative series, does there exist an equivalent polynomial automaton where all control states recognise commutative series? The answer for weighted automata is yes.