String attractors and combinatorics on words

Risultato della ricerca: Conference contribution

3 Citazioni (Scopus)

Abstract

The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w[1]w[2] · · · w[n] is a subset Γ of the positions 1, . . ., n, such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the notion of string attractor from a combinatorial point of view, by focusing on several families of finite words. The results presented in the paper suggest that the notion of string attractor can be used to define new tools to investigate combinatorial properties of the words.
Lingua originaleEnglish
Titolo della pubblicazione ospiteCEUR Workshop Proceedings
Pagine57-71
Numero di pagine15
Stato di pubblicazionePublished - 2019

Serie di pubblicazioni

NomeCEUR WORKSHOP PROCEEDINGS

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.1700.1700???

Fingerprint Entra nei temi di ricerca di 'String attractors and combinatorics on words'. Insieme formano una fingerprint unica.

Cita questo