On the Trace Product and some Families of Languages Closed under Partial Commutations

New automata-theoretic constructions for the product of recognizable trace languages are given. This study leads to investigate the effect of partial (and total) commutations on some families of recognizable languages (the Straubing-Therien's hierarchy of star-free languages).