A tight upper bound on the size of the antidictionary of a binary string

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.

[1]  A. Restivo,et al.  Data compression using antidictionaries , 2000, Proceedings of the IEEE.

[2]  Svante Janson,et al.  On the average sequence complexity , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[3]  Antonio Restivo,et al.  Automata and Forbidden Words , 1998, Inf. Process. Lett..

[4]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .