#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2005

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fabio Burderi, Antonio Restivo
- Discrete Mathematics & Theoretical Computer…
- 2007

- Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
- IJAC
- 2009

A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes… (More)

- Fabio Burderi, Antonio Restivo
- Theory of Computing Systems
- 2005

Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is… (More)

- Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
- Developments in Language Theory
- 2007

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite… (More)

- Fabio Burderi
- WORDS
- 2011

In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids… (More)

- Fabio Burderi, Giusi Castiglione, Antonio Restivo
- Fundam. Inform.
- 2006

- Fabio Burderi
- Int. J. Found. Comput. Sci.
- 2012

- ‹
- 1
- ›