This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of
, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of
are not deterministic, and analyze the reason for this asymmetry.