| 2009 |
| 77 | EE | Michelangelo Bucci,
Aldo de Luca,
Alessandro De Luca,
Luca Q. Zamboni:
On theta-episturmian words.
Eur. J. Comb. 30(2): 473-479 (2009) |
| 2008 |
| 76 | EE | Michelangelo Bucci,
Aldo de Luca,
Alessandro De Luca:
On a Generalization of Standard Episturmian Morphisms.
Developments in Language Theory 2008: 158-169 |
| 75 | EE | Aldo de Luca,
Amy Glen,
Luca Q. Zamboni:
Rich, Sturmian, and trapezoidal words
CoRR abs/0802.3885: (2008) |
| 74 | EE | Valérie Berthé,
Aldo de Luca,
Christophe Reutenauer:
On an involution of Christoffel words and Sturmian morphisms.
Eur. J. Comb. 29(2): 535-553 (2008) |
| 73 | EE | Michelangelo Bucci,
Aldo de Luca,
Alessandro De Luca,
Luca Q. Zamboni:
On different generalizations of episturmian words.
Theor. Comput. Sci. 393(1-3): 23-36 (2008) |
| 72 | EE | Aldo de Luca,
Amy Glen,
Luca Q. Zamboni:
Rich, Sturmian, and trapezoidal words.
Theor. Comput. Sci. 407(1-3): 569-573 (2008) |
| 2007 |
| 71 | EE | Arturo Carpi,
Aldo de Luca:
Farey codes and languages.
Eur. J. Comb. 28(1): 371-402 (2007) |
| 2006 |
| 70 | EE | Aldo de Luca,
Alessandro De Luca:
Combinatorial Properties of Sturmian Palindromes.
Int. J. Found. Comput. Sci. 17(3): 557-574 (2006) |
| 69 | EE | Aldo de Luca,
Alessandro De Luca:
Some characterizations of finite Sturmian words.
Theor. Comput. Sci. 356(1-2): 118-125 (2006) |
| 68 | EE | Aldo de Luca,
Alessandro De Luca:
Pseudopalindrome closure operators in free monoids.
Theor. Comput. Sci. 362(1-3): 282-300 (2006) |
| 2005 |
| 67 | EE | Aldo de Luca,
Alessandro De Luca:
Palindromes in Sturmian Words.
Developments in Language Theory 2005: 199-208 |
| 66 | EE | Arturo Carpi,
Aldo de Luca:
Central Sturmian Words: Recent Developments.
Developments in Language Theory 2005: 36-56 |
| 65 | EE | Arturo Carpi,
Aldo de Luca:
Completions in measure of languages and related combinatorial problems.
Theor. Comput. Sci. 330(1): 35-57 (2005) |
| 64 | EE | Aldo de Luca,
Filippo Mignosi,
Dominique Perrin,
Grzegorz Rozenberg:
Preface.
Theor. Comput. Sci. 340(1): 179-185 (2005) |
| 63 | EE | Arturo Carpi,
Aldo de Luca:
Codes of central Sturmian words.
Theor. Comput. Sci. 340(1): 220-239 (2005) |
| 2004 |
| 62 | EE | Arturo Carpi,
Aldo de Luca:
Harmonic and gold Sturmian words.
Eur. J. Comb. 25(5): 685-705 (2004) |
| 61 | EE | Arturo Carpi,
Aldo de Luca:
Repetitions, Fullness, And Uniformity In Two-Dimensional Words.
Int. J. Found. Comput. Sci. 15(2): 355-383 (2004) |
| 2003 |
| 60 | | Arturo Carpi,
Aldo de Luca:
Semiperiodic words and root-conjugacy.
Theor. Comput. Sci. 292(1): 111-130 (2003) |
| 2002 |
| 59 | EE | Aldo de Luca:
A Survey of Some Quantitative Approaches to the Notion of Information.
Formal and Natural Computing 2002: 77-95 |
| 58 | EE | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Words, univalent factors, and boxes.
Acta Inf. 38(6): 409-436 (2002) |
| 57 | EE | Arturo Carpi,
Aldo de Luca:
On the distribution of characteristic parameters of words.
ITA 36(1): 67-96 (2002) |
| 56 | EE | Arturo Carpi,
Aldo de Luca:
On the distribution of characteristic parameters of words II.
ITA 36(1): 97-127 (2002) |
| 55 | EE | Arturo Carpi,
Aldo de Luca:
A combinatorial property of the factor poset of a word.
Inf. Process. Lett. 81(1): 35-39 (2002) |
| 54 | EE | Aldo de Luca:
Some combinatorial results on Bernoulli sets and codes.
Theor. Comput. Sci. 273(1-2): 143-165 (2002) |
| 2001 |
| 53 | EE | Arturo Carpi,
Aldo de Luca:
Periodic-like words, periodicity, and boxes.
Acta Inf. 37(8): 597-618 (2001) |
| 52 | EE | Arturo Carpi,
Aldo de Luca:
Words and special factors.
Theor. Comput. Sci. 259(1-2): 145-182 (2001) |
| 51 | EE | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst. 34(4): 375-395 (2001) |
| 2000 |
| 50 | EE | Arturo Carpi,
Aldo de Luca:
Periodic-Like Words.
MFCS 2000: 264-274 |
| 49 | EE | Arturo Carpi,
Aldo de Luca:
Special Factors, Periodicity, and an Application to Sturmian Words.
Acta Inf. 36(12): 983-1006 (2000) |
| 1999 |
| 48 | | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Special factors in some combinational structures.
Developments in Language Theory 1999: 3-13 |
| 47 | | Arturo Carpi,
Aldo de Luca:
Repetitions and Boxes in Words and Pictures.
Jewels are Forever 1999: 295-306 |
| 46 | EE | Aldo de Luca:
On the Combinatorics of Finite Words.
Theor. Comput. Sci. 218(1): 13-39 (1999) |
| 1998 |
| 45 | EE | Aldo de Luca:
A Conjecture on Continued Fractions.
Theor. Comput. Sci. 204(1-2): 75-86 (1998) |
| 1997 |
| 44 | | Aldo de Luca:
Combinatories of Standard Sturmian Words.
Structures in Logic and Computer Science 1997: 249-267 |
| 43 | EE | Jean Berstel,
Aldo de Luca:
Sturmian Words, Lyndon Words and Trees.
Theor. Comput. Sci. 178(1-2): 171-203 (1997) |
| 42 | EE | Aldo de Luca:
Standard Sturmian Morphisms.
Theor. Comput. Sci. 178(1-2): 205-224 (1997) |
| 41 | EE | Aldo de Luca:
Sturmian Words: Structure, Combinatorics, and Their Arithmetics.
Theor. Comput. Sci. 183(1): 45-82 (1997) |
| 1996 |
| 40 | | Aldo de Luca:
On Standard Sturmian Morphisms.
ICALP 1996: 403-415 |
| 1995 |
| 39 | EE | Aldo de Luca:
A Division Property of the Fibonacci Word.
Inf. Process. Lett. 54(6): 307-312 (1995) |
| 1994 |
| 38 | | Aldo de Luca,
Stefano Varricchio:
On a Conjecture of Brzozowski.
IFIP Congress (1) 1994: 465-472 |
| 37 | | Aldo de Luca,
Stefano Varricchio:
Well Quasi-Orders and Regular Languages.
Acta Inf. 31(6): 539-557 (1994) |
| 36 | | Aldo de Luca,
Licia Mione:
On Bispecial Factors of the Thue-Morse Word.
Inf. Process. Lett. 49(4): 179-183 (1994) |
| 35 | | Aldo de Luca,
Filippo Mignosi:
Some Combinatorial Properties of Sturmian Words.
Theor. Comput. Sci. 136(2): 361-285 (1994) |
| 1992 |
| 34 | | Aldo de Luca,
Stefano Varricchio:
Some Regularity Conditions Based on Well Quasi-Orders.
LATIN 1992: 356-371 |
| 33 | | Aldo de Luca,
Stefano Varricchio:
On Finitely Recognizable Semigroups.
Acta Inf. 29(5): 483-498 (1992) |
| 32 | | Aldo de Luca,
Stefano Varricchio:
On Noncounting Regular Classes.
Theor. Comput. Sci. 100(1): 67-104 (1992) |
| 1991 |
| 31 | | Aldo de Luca,
Stefano Varricchio:
Finiteness and Iteration Conditions for Semigroups.
Theor. Comput. Sci. 87(2): 315-327 (1991) |
| 1990 |
| 30 | | Aldo de Luca,
Stefano Varricchio:
On Non-Counting Regular Classes.
ICALP 1990: 74-87 |
| 29 | | Aldo de Luca,
Stefano Varricchio:
A combinatorial theorem on p-power-free words and an application to semigroups.
ITA 24: 205-228 (1990) |
| 28 | | Arturo Carpi,
Aldo de Luca:
Non-Repetitive Words Relative to a Rewriting System.
Theor. Comput. Sci. 72(1): 39-53 (1990) |
| 1989 |
| 27 | | Aldo de Luca,
Stefano Varricchio:
A positive pumping condition for regular sets.
Bulletin of the EATCS 39: 171-174 (1989) |
| 26 | | Aldo de Luca,
Stefano Varricchio:
Factorial Languages Whose Growth Function is Quadratically Upper Bounded.
Inf. Process. Lett. 30(6): 283-288 (1989) |
| 25 | | Aldo de Luca,
Stefano Varricchio:
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.
Theor. Comput. Sci. 63(3): 333-348 (1989) |
| 1988 |
| 24 | | Aldo de Luca,
Stefano Varricchio:
A finiteness condition for semigroups.
Formal Properties of Finite Automata and Applications 1988: 138-147 |
| 23 | | Aldo de Luca,
Stefano Varricchio:
On the Factors of the Thue-Morse Word on Three Symbols.
Inf. Process. Lett. 27(6): 281-285 (1988) |
| 22 | | Aldo de Luca,
M. Pelagalli,
Stefano Varricchio:
Test Sets for Languages of Infinite Words.
Inf. Process. Lett. 29(2): 91-95 (1988) |
| 1986 |
| 21 | | Aldo de Luca,
Antonio Restivo:
On a generalization of a conjecture of Ehrenfeucht.
Bulletin of the EATCS 30: 84-90 (1986) |
| 20 | | Arturo Carpi,
Aldo de Luca:
Square-Free Words on Partially Commutative Free Monoids.
Inf. Process. Lett. 22(3): 125-131 (1986) |
| 19 | | Aldo de Luca,
Antonio Restivo:
Star-Free Sets of Integers.
Theor. Comput. Sci. 43: 265-275 (1986) |
| 1984 |
| 18 | | Aldo de Luca,
Antonio Restivo:
Representations lf Integers and Language Theory.
MFCS 1984: 407-415 |
| 17 | EE | Aldo de Luca:
On the product of square-free words.
Discrete Mathematics 52(2-3): 143-157 (1984) |
| 1983 |
| 16 | | Aldo de Luca,
Antonio Restivo,
Sergio Salemi:
On the Centers of a Language.
Theor. Comput. Sci. 24: 21-34 (1983) |
| 1982 |
| 15 | EE | Aldo de Luca:
On some combinatorial problems in free monoids.
Discrete Mathematics 38(2-3): 207-225 (1982) |
| 1981 |
| 14 | | Aldo de Luca:
A Combinatorial Property of the Fibonacci Words.
Inf. Process. Lett. 12(4): 193-195 (1981) |
| 1980 |
| 13 | | Aldo de Luca,
Antonio Restivo:
On Some Properties of Local Testability.
ICALP 1980: 385-393 |
| 12 | | Aldo de Luca:
On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup.
ITA 14(1): 39-56 (1980) |
| 11 | | Aldo de Luca,
Antonio Restivo:
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
Information and Control 44(3): 300-319 (1980) |
| 10 | | Aldo de Luca,
Antonio Restivo:
On Some Properties of Very Pure Codes.
Theor. Comput. Sci. 10: 157-170 (1980) |
| 9 | | Jean-Marie Boë,
Aldo de Luca,
Antonio Restivo:
Minimal Complete Sets of Words.
Theor. Comput. Sci. 12: 325-332 (1980) |
| 1979 |
| 8 | | Aldo de Luca,
Antonio Restivo:
Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup.
MFCS 1979: 363-371 |
| 1978 |
| 7 | | Aldo de Luca:
A Combinatorial Property of Finite Prefix Codes
Information and Control 37(3): 267-279 (1978) |
| 1977 |
| 6 | | Aldo de Luca,
Settimo Termini:
Measures of Ambiguity in the Analysis of Complex Systems.
MFCS 1977: 382-389 |
| 1976 |
| 5 | | Aldo de Luca:
A Note on Variable Length Codes
Information and Control 32(3): 263-271 (1976) |
| 1975 |
| 4 | | Aldo de Luca:
On the entropy of a formal language.
Automata Theory and Formal Languages 1975: 103-109 |
| 1974 |
| 3 | | Aldo de Luca,
Settimo Termini:
Entropy of L-Fuzzy Sets
Information and Control 24(1): 55-73 (1974) |
| 1973 |
| 2 | | Renato M. Capocelli,
Aldo de Luca:
Fuzzy Sets and Decision Theory
Information and Control 23(5): 446-473 (1973) |
| 1972 |
| 1 | | Aldo de Luca,
Settimo Termini:
A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory
Information and Control 20(4): 301-312 (1972) |