  We show that if $D$ is a tournament of arbitrary size then $D$ has finite
strong components after reversing a locally finite sequence of cycles. In turn,
we prove that any tournament can be covered by two acyclic sets after reversing
a locally finite sequence of cycles. This provides a partial solution to a
conjecture of S. Thomass\'e.

Combinatorics;Logic