A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory - Aldo de Luca; Settimo Termini (Inf. Control., 1972)

Fuzzy Sets and Decision Theory - Renato M. Capocelli; Aldo de Luca (Inf. Control., 1973)

Entropy of L-Fuzzy Sets - Aldo de Luca; Settimo Termini (Inf. Control., 1974)

On the entropy of a formal language. - Aldo de Luca (Automata Theory and Formal Languages, 1975)

A Note on Variable Length Codes - Aldo de Luca (Inf. Control., 1976)

Measures of Ambiguity in the Analysis of Complex Systems. - Aldo de Luca; Settimo Termini (MFCS, 1977)

A Combinatorial Property of Finite Prefix Codes - Aldo de Luca (Inf. Control., 1978)

Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup. - Aldo de Luca; Antonio Restivo (MFCS, 1979)

Synchronization and simplification. - Aldo de Luca; Dominique Perrin; Antonio Restivo; Settimo Termini (Discret. Math., 1979)

On Some Properties of Local Testability. - Aldo de Luca; Antonio Restivo (ICALP, 1980)

On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup. - Aldo de Luca (RAIRO Theor. Informatics Appl., 1980)

Minimal Complete Sets of Words. - Jean-Marie Boë; Aldo de Luca; Antonio Restivo (Theor. Comput. Sci., 1980)

On Some Properties of Very Pure Codes. - Aldo de Luca; Antonio Restivo (Theor. Comput. Sci., 1980)

A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup - Aldo de Luca; Antonio Restivo (Inf. Control., 1980)

A Combinatorial Property of the Fibonacci Words. - Aldo de Luca (Inf. Process. Lett., 1981)

On some combinatorial problems in free monoids. - Aldo de Luca (Discret. Math., 1982)

On the Centers of a Language. - Aldo de Luca; Antonio Restivo; Sergio Salemi (Theor. Comput. Sci., 1983)

Representations lf Integers and Language Theory. - Aldo de Luca; Antonio Restivo (MFCS, 1984)

On the product of square-free words. - Aldo de Luca (Discret. Math., 1984)

A decision procedure on partially commutative free monoids. - Aldo de Luca; Antonio Massarotti (Discret. Appl. Math., 1986)

On a generalization of a conjecture of Ehrenfeucht. - Aldo de Luca; Antonio Restivo (Bull. EATCS, 1986)

Square-Free Words on Partially Commutative Free Monoids. - Arturo Carpi; Aldo de Luca (Inf. Process. Lett., 1986)

Star-Free Sets of Integers. - Aldo de Luca; Antonio Restivo (Theor. Comput. Sci., 1986)

A finiteness condition for semigroups. - Aldo de Luca; Stefano Varricchio (Formal Properties of Finite Automata and Applications, 1988)

Test Sets for Languages of Infinite Words. - Aldo de Luca; M. Pelagalli; Stefano Varricchio (Inf. Process. Lett., 1988)

On the Factors of the Thue-Morse Word on Three Symbols. - Aldo de Luca; Stefano Varricchio (Inf. Process. Lett., 1988)

A positive pumping condition for regular sets. - Aldo de Luca; Stefano Varricchio (Bull. EATCS, 1989)

Factorial Languages Whose Growth Function is Quadratically Upper Bounded. - Aldo de Luca; Stefano Varricchio (Inf. Process. Lett., 1989)

Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups. - Aldo de Luca; Stefano Varricchio (Theor. Comput. Sci., 1989)

On Non-Counting Regular Classes. - Aldo de Luca; Stefano Varricchio (ICALP, 1990)

A combinatorial theorem on p-power-free words and an application to semigroups. - Aldo de Luca; Stefano Varricchio (RAIRO Theor. Informatics Appl., 1990)

Non-Repetitive Words Relative to a Rewriting System. - Arturo Carpi; Aldo de Luca (Theor. Comput. Sci., 1990)

Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups. - Aldo de Luca; Stefano Varricchio (Int. J. Algebra Comput., 1991)

Finiteness and Iteration Conditions for Semigroups. - Aldo de Luca; Stefano Varricchio (Theor. Comput. Sci., 1991)

Some Regularity Conditions Based on Well Quasi-Orders. - Aldo de Luca; Stefano Varricchio (LATIN, 1992)

On Finitely Recognizable Semigroups. - Aldo de Luca; Stefano Varricchio (Acta Informatica, 1992)

On Noncounting Regular Classes. - Aldo de Luca; Stefano Varricchio (Theor. Comput. Sci., 1992)

On a Conjecture of Brzozowski. - Aldo de Luca; Stefano Varricchio (IFIP Congress (1), 1994)

Well Quasi-Orders and Regular Languages. - Aldo de Luca; Stefano Varricchio (Acta Informatica, 1994)

On Bispecial Factors of the Thue-Morse Word. - Aldo de Luca; Licia Mione (Inf. Process. Lett., 1994)

Some Combinatorial Properties of Sturmian Words. - Aldo de Luca; Filippo Mignosi (Theor. Comput. Sci., 1994)

A Division Property of the Fibonacci Word. - Aldo de Luca (Inf. Process. Lett., 1995)

Combinatories of Standard Sturmian Words. - Aldo de Luca (Structures in Logic and Computer Science, 1997)

Sturmian Words, Lyndon Words and Trees. - Jean Berstel; Aldo de Luca (Theor. Comput. Sci., 1997)

Standard Sturmian Morphisms. - Aldo de Luca (Theor. Comput. Sci., 1997)

Sturmian Words: Structure, Combinatorics, and Their Arithmetics. - Aldo de Luca (Theor. Comput. Sci., 1997)

Regularity and Finiteness Conditions. - Aldo de Luca; Stefano Varricchio (Handbook of Formal Languages (1), 1997)

A Conjecture on Continued Fractions. - Aldo de Luca (Theor. Comput. Sci., 1998)

Repetitions and Boxes in Words and Pictures. - Arturo Carpi; Aldo de Luca (Jewels are Forever, 1999)

Special factors in some combinational structures. - Arturo Carpi; Aldo de Luca; Stefano Varricchio (Developments in Language Theory, 1999)

On the Combinatorics of Finite Words. - Aldo de Luca (Theor. Comput. Sci., 1999)

Finiteness and Regularity in Semigroups and Formal Languages - Aldo de Luca; Stefano Varricchio (Springer, 1999)

Periodic-Like Words. - Arturo Carpi; Aldo de Luca (MFCS, 2000)

Special Factors, Periodicity, and an Application to Sturmian Words. - Arturo Carpi; Aldo de Luca (Acta Informatica, 2000)

Periodic-like words, periodicity, and boxes. - Arturo Carpi; Aldo de Luca (Acta Informatica, 2001)

Special Factors and Uniqueness Conditions in Rational Trees. - Arturo Carpi; Aldo de Luca; Stefano Varricchio (Theory Comput. Syst., 2001)

Words and special factors. - Arturo Carpi; Aldo de Luca (Theor. Comput. Sci., 2001)

A Survey of Some Quantitative Approaches to the Notion of Information. - Aldo de Luca (Formal and Natural Computing, 2002)

Words, univalent factors, and boxes. - Arturo Carpi; Aldo de Luca; Stefano Varricchio (Acta Informatica, 2002)

A combinatorial property of the factor poset of a word. - Arturo Carpi; Aldo de Luca (Inf. Process. Lett., 2002)

On the distribution of characteristic parameters of words. - Arturo Carpi; Aldo de Luca (RAIRO Theor. Informatics Appl., 2002)

On the distribution of characteristic parameters of words II. - Arturo Carpi; Aldo de Luca (RAIRO Theor. Informatics Appl., 2002)

Some combinatorial results on Bernoulli sets and codes. - Aldo de Luca (Theor. Comput. Sci., 2002)

Semiperiodic words and root-conjugacy. - Arturo Carpi; Aldo de Luca (Theor. Comput. Sci., 2003)

Uniform words. - Arturo Carpi; Aldo de Luca (Adv. Appl. Math., 2004)

Harmonic and gold Sturmian words. - Arturo Carpi; Aldo de Luca (Eur. J. Comb., 2004)

Repetitions, Fullness, And Uniformity In Two-Dimensional Words. - Arturo Carpi; Aldo de Luca (Int. J. Found. Comput. Sci., 2004)

Central Sturmian Words: Recent Developments. - Arturo Carpi; Aldo de Luca (Developments in Language Theory, 2005)

Palindromes in Sturmian Words. - Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2005)

Some decompositions of Bernoulli sets and codes. - Aldo de Luca (RAIRO Theor. Informatics Appl., 2005)

Completions in measure of languages and related combinatorial problems. - Arturo Carpi; Aldo de Luca (Theor. Comput. Sci., 2005)

Codes of central Sturmian words. - Arturo Carpi; Aldo de Luca (Theor. Comput. Sci., 2005)

Preface. - Aldo de Luca; Filippo Mignosi; Dominique Perrin; Grzegorz Rozenberg (Theor. Comput. Sci., 2005)

Combinatorial Properties of Sturmian Palindromes. - Aldo de Luca; Alessandro De Luca 002 (Int. J. Found. Comput. Sci., 2006)

Pseudopalindrome closure operators in free monoids. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2006)

Some characterizations of finite Sturmian words. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2006)

Farey codes and languages. - Arturo Carpi; Aldo de Luca (Eur. J. Comb., 2007)

On a Generalization of Standard Episturmian Morphisms. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2008)

On an involution of Christoffel words and Sturmian morphisms. - Valérie Berthé; Aldo de Luca; Christophe Reutenauer (Eur. J. Comb., 2008)

On some problems related to palindrome closure. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2008)

On different generalizations of episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (Theor. Comput. Sci., 2008)

Rich, Sturmian, and trapezoidal words. - Aldo de Luca; Amy Glen; Luca Q. Zamboni (Theor. Comput. Sci., 2008)

Rich and Periodic-Like Words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2009)

A palindromization map in free monoids. - Aldo de Luca (ICTCS, 2009)

On theta-episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (Eur. J. Comb., 2009)

Characteristic morphisms of generalized episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2009)

Involutions of epicentral words. - Aldo de Luca; Luca Q. Zamboni (Eur. J. Comb., 2010)

On the number of episturmian palindromes. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2010)

On graphs of central episturmian words. - Aldo de Luca; Luca Q. Zamboni (Theor. Comput. Sci., 2010)

A standard correspondence on epicentral words. - Aldo de Luca (Eur. J. Comb., 2012)

A generalized palindromization map in free monoids. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2012)

A Coloring Problem for Sturmian and Episturmian Words. - Aldo de Luca; Elena V. Pribavkina; Luca Q. Zamboni (Developments in Language Theory, 2013)

Some extremal Properties of the Fibonacci Word. - Aldo de Luca (Int. J. Algebra Comput., 2013)

A coloring problem for infinite words. - Aldo de Luca; Elena V. Pribavkina; Luca Q. Zamboni (J. Comb. Theory A, 2014)

Sturmian words and the Stern sequence. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2015)

On prefixal factorizations of words. - Aldo de Luca; Luca Q. Zamboni (Eur. J. Comb., 2016)

On some variations of coloring problems of infinite words. - Aldo de Luca; Luca Q. Zamboni (J. Comb. Theory A, 2016)

On Christoffel and standard words and their derivatives. - Alma D'Aniello; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2017)