In , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We show that regular processes, i.e., processes dened using nitely many guarded recursive equations, are as expressive as nite timed automata. The proof uses only the axiom system and unfolding of recursive equations. Since the proofs are basically algorithms, we also provide an eective method to translate from one model into the other. A remarkable corollary of these proofs is that regular recursive specications may need one clock less than timed automata in order to represent the same process.