trees

Abstract The deficiency of a string is the maximum number of bits it can be compressed. We study sets of strings with finite (bounded) deficiency, which are called incompressible sets. Among them, observation shows that “thin” ones cannot be effectively transformed into “fat” ones unless they are complete.