Kolmogorov structure functions for automatic complexity
  For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence. 
Bj{\o}rn Kjos-Hanssen
cs.FL math.LO