#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1967

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Aldo de Luca, Settimo Termini
- Information and Control
- 1972

A functional defined on the class of generalized characteristic functions (fuzzy sets), called "entropy", is introduced using no probabilistic concepts in order to obtain a global measure of the indefiniteness connected with the situations described by fuzzy sets. This "entropy" may be regarded as a measure of a quantity of information which is not… (More)

- Aldo de Luca
- Theor. Comput. Sci.
- 1997

We prove some new results concerning the structure, the combinatorics and the arithmetics of the set PER of all the words w having two periods p and q, p <q, which are coprimes and such that ]w] = pfq-2. A basic theorem relating PER with the set of finite standard Sturmian words was proved in de Luca and Mignosi (1994). The main result of this paper is the… (More)

- Aldo de Luca, Filippo Mignosi
- Theor. Comput. Sci.
- 1994

- Jean Berstel, Aldo de Luca
- Theor. Comput. Sci.
- 1997

We prove some new combinatorial properties of the set PER of all words w having two periods p and q which are coprimes and such that w = p + q 2 [4,3]. We show that aPERb U {a, b} = St n Lynd, where St is the set of the finite factors of all infinite Sturmian words and Lynd is the set of the Lyndon words on the alphabet {a, b}. It is also shown that aPERb U… (More)

- Aldo de Luca
- Inf. Process. Lett.
- 1981

- Aldo de Luca, Alessandro De Luca
- Theor. Comput. Sci.
- 2006

We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some… (More)

- Aldo de Luca
- Theor. Comput. Sci.
- 1999

- Aldo de Luca, Stefano Varricchio
- Monographs in Theoretical Computer Science. An…
- 1999

- Aldo de Luca, Stefano Varricchio
- Theor. Comput. Sci.
- 1990

- Aldo de Luca, Alessandro De Luca
- Int. J. Found. Comput. Sci.
- 2006

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.