Geodesic
A tight upper bound on the size of the antidictionary of a binary string
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2005_special_249_a26,
     author = {Morita, Hiroyoshi and Ota, Takahiro},
     title = {A tight upper bound on the size of the antidictionary of a binary string},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
     year = {2005},
     doi = {10.46298/dmtcs.3378},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3378/}
}
TY  - JOUR
AU  - Morita, Hiroyoshi
AU  - Ota, Takahiro
TI  - A tight upper bound on the size of the antidictionary of a binary string
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3378/
DO  - 10.46298/dmtcs.3378
LA  - en
ID  - DMTCS_2005_special_249_a26
ER  - 
%0 Journal Article
%A Morita, Hiroyoshi
%A Ota, Takahiro
%T A tight upper bound on the size of the antidictionary of a binary string
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3378/
%R 10.46298/dmtcs.3378
%G en
%F DMTCS_2005_special_249_a26
Morita, Hiroyoshi; Ota, Takahiro. A tight upper bound on the size of the antidictionary of a binary string. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005). doi : 10.46298/dmtcs.3378. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3378/

Cité par Sources :