We prove that fair list languages are not closed under reversal. This answers a question of a paper by Breveglieri. We then introduce a "strict" parallel product that defines a family closed under reversal; we show that this product properly generalizes the parallel product.