activity
20182022
most citedString Attractors and Combinatorics on Words

4 citations · 9 across the 5 of their papers we have counts for

collaborators

9 papers

quant-ph20221 cited

Possibilistic approach to network nonlocality

Antoine Restivo, Nicolas Brunner, Denis Rosset

The investigation of Bell nonlocality traditionally relies on joint probabilities of observing certain measurement outcomes. In this work we explore a possibilistic approach, where…

math.DS20221 cited

A note on one-sided recognizable morphisms

Marie-Pierre Béal, Valérie Berthé, Dominique Perrin +1

We revisit the notion of one-sided recognizability of morphisms and its relation to two-sided recognizability.

cs.FL2021

A new distance based on minimal absent words and applications to biological sequences

Giuseppa Castiglione, Jia Gao, Sabrina Mantaci +1

A minimal absent word of a sequence x, is a sequence yt hat is not a factorof x, but all of its proper factors are factors of x as well. The set of minimal absent words uniquely de…

cs.FL2020

Primitive Sets of Words

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

Given a (finite or infinite) subset of the free monoid over a finite alphabet , the rank of is the minimal cardinality of a set such that . We…

cs.DS20194 cited

String Attractors and Combinatorics on Words

Sabrina Mantaci, Antonio Restivo, Giuseppe Romana +2

The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-ba…

cs.DS2019

The Alternating BWT: an algorithmic perspective

Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo +2

The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures,…