A tight upper bound on the size of the antidictionary of a binary string
Hiroyoshi Morita, Takahiro Ota
Abstract
A tight upper bound of the size of the antidictionary of a binary string is presented. And it is shown that the size of the antidictionary of a binary sting is always smaller than or equal to that of its dictionary. Moreover, an algorithm to reconstruct its dictionary from its antidictionary is given.
Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page