@article{dmtcs:3378,
    title      = {A tight upper bound on the size of the antidictionary of a binary string},
    author     = {Hiroyoshi Morita and Takahiro Ota},
    url        = {https://dmtcs.episciences.org/3378},
    doi        = {10.46298/dmtcs.3378},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
    issuetitle = {Proceedings},
    eid        = 27,
    year       = {2005},
    month      = {Jan},
    keywords   = {antidictionary, minimum forbidden words, suffix trees, data compression, ECG, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]},
    language   = {English},
}