Zobrazeno 1 - 10
of 275
pro vyhledávání: '"RESTIVO, Antonio"'
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 proposals are based on alternative definitions of a Dyck language, whi
Externí odkaz:
http://arxiv.org/abs/2307.16522
We investigate questions related to the notion of recognizability of sequences of morphisms, a generalization of Moss{\'e}'s Theorem. We consider the most general class of morphisms including ones with erasable letters. The main result states that a
Externí odkaz:
http://arxiv.org/abs/2302.06258
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 order 2. The family of recognizable picture languages is also defined
Externí odkaz:
http://arxiv.org/abs/2206.05208
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 of its factors can be "attracted". The smallest size $\gamma^*$ of a
Externí odkaz:
http://arxiv.org/abs/2206.00376
Autor:
Giancarlo, Raffaele, Manzini, Giovanni, Restivo, Antonio, Rosone, Giovanna, Sciortino, Marinella
Introduced about thirty years ago in the field of Data Compression, the Burrows-Wheeler Transform (BWT) is a string transformation that, besides being a booster of the performance of memoryless compressors, plays a fundamental role in the design of e
Externí odkaz:
http://arxiv.org/abs/2205.05643
We revisit the notion of one-sided recognizability of morphisms and its relation to two-sided recognizability.
Externí odkaz:
http://arxiv.org/abs/2204.03892
Autor:
Cassaigne, Julien, Gheeraert, France, Restivo, Antonio, Romana, Giuseppe, Sciortino, Marinella, Stipulanti, Manon
Publikováno v:
In Journal of Combinatorial Theory, Series A November 2024 208
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space g
Externí odkaz:
http://arxiv.org/abs/2112.14499
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the result of Be
Externí odkaz:
http://arxiv.org/abs/2110.10267
Publikováno v:
In Journal of Computer and System Sciences August 2024 143