Kolmogorov structure functions for automatic complexity

For a finite word w of length n   we define and study the Kolmogorov structure function hwhw for nondeterministic automatic complexity. We prove upper bounds on hwhw that appear to be quite sharp, based on numerical evidence.