A tight upper bound on the size of the antidictionary of a binary string - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAD0137.pdf (430.3 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184213 , version 1 (13-08-2015)

Identifiers

Cite

Hiroyoshi Morita, Takahiro Ota. A tight upper bound on the size of the antidictionary of a binary string. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.393-398, ⟨10.46298/dmtcs.3378⟩. ⟨hal-01184213⟩

Collections

TDS-MACS
29 View
525 Download

Altmetric

Share

Gmail Facebook X LinkedIn More