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