6 citations · 12 across the 3 of their papers we have counts for
13 papers
Digital Convexity and Combinatorics on Words
Alessandro De Luca, Gabriele Fici, Andrea Frosini
An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We stud…
Adaptive Learning of Compressible Strings
Gabriele Fici, Nicola Prezza, Rossano Venturini
Suppose an oracle knows a string that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is a substring of ?". In 1995, Skiena an…
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…
Minimal Absent Words in Rooted and Unrooted Trees
Gabriele Fici, Paweł Gawrychowski
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet of cardinality . We show that the set $\text{MA…
Constructing Antidictionaries in Output-Sensitive Space
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici +2
A word that is absent from a word is called minimal if all its proper factors occur in . Given a collection of words over an alphabet , we ar…
Abelian Anti-Powers in Infinite Words
Gabriele Fici, Mickael Postic, Manuel Silva
An abelian anti-power of order (or simply an abelian -anti-power) is a concatenation of consecutive words of the same length having pairwise distinct Parikh vectors. Thi…