Upper Bounds for the Complexity of Sparse and Tally Descriptions

Vikraman Arvind, Johannes Köbler, Martin Mundhenk. Upper Bounds for the Complexity of Sparse and Tally Descriptions. Theory Comput. Syst., 29(1):63-94, 1996.

Abstract

Abstract is missing.