The set of all binary strings terminated by a specific pattern is countably infinite and regular and satisfies the prefix property. Some properties of such codeword sets in the context of source coding are studied. It is shown that some of them are universal and some of them are not, but none is asymptotically optimal.