Currently displaying 1 – 12 of 12

Showing per page

Order by Relevance | Title | Year of publication

Some decompositions of Bernoulli sets and codes

Aldo de Luca — 2010

RAIRO - Theoretical Informatics and Applications

A decomposition of a set of words over a -letter alphabet is any sequence of subsets of such that the sets , are pairwise disjoint, their union is , and for all , , where ~ denotes the commutative equivalence relation. We introduce some suitable decompositions that we call good, admissible, and normal. A normal decomposition is admissible and an admissible decomposition is good. We prove that a set is commutatively prefix if and only if it has a normal decomposition. In particular,...

Some decompositions of Bernoulli sets and codes

Aldo de Luca — 2005

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A decomposition of a set X of words over a d -letter alphabet A = { a 1 , ... , a d } is any sequence X 1 , ... , X d , Y 1 , ... , Y d of subsets of A * such that the sets X i , i = 1 , ... , d , are pairwise disjoint, their union is X , and for all i , 1 i d , X i a i Y i , where denotes the commutative equivalence relation. We introduce some suitable decompositions that we call good, admissible, and normal. A normal decomposition is admissible and an admissible decomposition is good. We prove that a set is commutatively prefix if and only if it has a normal decomposition. In particular,...

On the distribution of characteristic parameters of words II

Arturo CarpiAldo de Luca — 2002

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The characteristic parameters K w and R w of a word w over a finite alphabet are defined as follows: K w is the minimal natural number such that w has no repeated suffix of length K w and R w is the minimal natural number such that w has no right special factor of length R w . In a previous paper, published on this journal, we have studied the distributions of these parameters, as well as the distribution of the maximal length of a repetition, among the words of each length on a given alphabet. In this paper...

On the distribution of characteristic parameters of words

Arturo CarpiAldo de Luca — 2002

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For any finite word w on a finite alphabet, we consider the basic parameters R w and K w of w defined as follows: R w is the minimal natural number for which w has no right special factor of length R w and K w is the minimal natural number for which w has no repeated suffix of length K w . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.

On minimal redundancy codes.

Aldo De LucaMaria I. Sessa — 1982

Stochastica

A code X over the alphabet A is complete if the submonoid X* generated by X meets all two-sided ideals of A*. If one measures the cost of a finite code X over A, with respect to a given information source S, by the quantity gamma(X) = <X> ln |A|, we say that X is completely optimal for S if it does not exist any code X', over an arbitrary alphabet, such that gamma (X') < gamma (X). One can show that for |X| ≤ 5 a completely optimal code has to be complete. However for |X| >...

On the distribution of characteristic parameters of words

Arturo CarpiAldo de Luca — 2010

RAIRO - Theoretical Informatics and Applications

For any finite word on a finite alphabet, we consider the basic parameters and of defined as follows: is the minimal natural number for which has no right special factor of length and is the minimal natural number for which has no repeated suffix of length . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length...

On the distribution of characteristic parameters of words II

Arturo CarpiAldo de Luca — 2010

RAIRO - Theoretical Informatics and Applications

The characteristic parameters and of a word over a finite alphabet are defined as follows: is the minimal natural number such that has no repeated suffix of length and is the minimal natural number such that has no right special factor of length . In a previous paper, published on this journal, we have studied the distributions of these parameters, as well as the distribution of the maximal...

On some problems related to palindrome closure

Michelangelo BucciAldo de LucaAlessandro De LucaLuca Q. Zamboni — 2008

RAIRO - Theoretical Informatics and Applications

In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if is an involutory antimorphism of , then the right and left -palindromic closures of any factor of a -standard word are also factors of some -standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure starting from...

Page 1

Download Results (CSV)