We study here a kind of rewriting systems called controlled rewriting systems (c-systems for short) which generalise the notion of regular semi-Thue systems. We show that the deterministic context-free languages are exactly the sets of the form , where R is a rational set and is the right-congruence generated by a c-system of S of a restricted type (S is basic and confluent).