16 citations · 39 across the 17 of their papers we have counts for
9 papers · 1 filter
Two-dimensional Dyck words
Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro
We propose different ways of lifting the notion of Dyck language from words to 2-dimensional (2D) pictures, by means of new definitions of increasing comprehensiveness. Two of the…
Recognizability in S-adic shifts
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo +1
We investigate questions related to the notion of recognizability of sequences of morphisms, a generalization of Moss{é}'s Theorem. We consider the most general class of morphisms…
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Stefano {Crespi Reghizzi}, Antonio Restivo, Pierluigi {San Pietro}
A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of…
String Attractors and Infinite Words
Antonio Restivo, Giuseppe Romana, Marinella Sciortino
The notion of string attractor has been introduced in [Kempa and Prezza, 2018] in the context of Data Compression and it represents a set of positions of a finite word in which all…
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…
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…
On Sets of Words of Rank Two
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 . A…
Minimal Forbidden Factors of Circular Words
Gabriele Fici, Antonio Restivo, Laura Rizzo
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactor…
Birecurrent sets
Francesco Dolce, Dominique Perrin, Antonio Restivo +2
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecur…