In this paper we give two families of codes which are minimal generators ofbiinfinite languages: the family of very thin codes (which contains the rationalcodes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.