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

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.
Type de document :
Communication dans un congrès
Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.393-398, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184213
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 13 août 2015 - 13:34:34
Dernière modification le : jeudi 11 mai 2017 - 01:03:09
Document(s) archivé(s) le : samedi 14 novembre 2015 - 10:22:42

Fichier

dmAD0137.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184213, version 1

Collections

Citation

Hiroyoshi Morita, Takahiro Ota. A tight upper bound on the size of the antidictionary of a binary string. Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.393-398, 2005, DMTCS Proceedings. 〈hal-01184213〉

Partager

Métriques

Consultations de la notice

61

Téléchargements de fichiers

162