Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aldo de Luca

dblp:41/520 · DBLP profile ↗
← Back
65ranked-venue papers
42as first author
0since 2021 · last 2017
0000-0003-0259-0289ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 65 · 42 first-authorDatabases, data management, data science and information retrieval · 8 · 6 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
9 papers
Automata and formal languages · 65% Combinatorics and discrete mathematics · 16% Coding theory · 11%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

Topics — the 9 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
regular languages
0.011990
On Non-Counting Regular Classes · ICALP 1990
Combinatorics and discrete mathematics
combinatorics on words
0.011996
On Standard Sturmian Morphisms · ICALP 1996
Coding theory
local testability
0.011980
On Some Properties of Local Testability · ICALP 1980
Logic in computer science
fuzzy set theory
0.021974
Entropy of L-Fuzzy Sets · Inf. Control. 1974
A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory · Inf. Control. 1972
Coding theory › source coding › variable-length codes
prefix codes
0.011978
A Combinatorial Property of Finite Prefix Codes · Inf. Control. 1978
Coding theory › source coding
variable-length codes
0.011976
A Note on Variable Length Codes · Inf. Control. 1976
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning › fuzzy systems
fuzzy logic
0.011973
Fuzzy Sets and Decision Theory · Inf. Control. 1973
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
fuzzy sets
0.011973
Fuzzy Sets and Decision Theory · Inf. Control. 1973
Algorithmic game theory and mechanism design
decision theory
0.011973
Fuzzy Sets and Decision Theory · Inf. Control. 1973
YearPublicationVenuePosition
2017 On Christoffel and standard words and their derivatives
Alma D'Aniello, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2015 Sturmian words and the Stern sequence
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.1
2013 A Coloring Problem for Sturmian and Episturmian Words
abstract
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word w, does there exist a finite coloring of its factors such that no factorization of w is monochromatic? We show that such a coloring always exists whenever w is a Sturmian word or a standard episturmian word. © 2013 Springer-Verlag.
Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
Developments in Language Theory1
2012 A generalized palindromization map in free monoids
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.1
2010 On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2010 On graphs of central episturmian words
Aldo de Luca, Luca Q. Zamboni
Theor. Comput. Sci.1
2009 Rich and Periodic-Like Words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory2
2009 Characteristic morphisms of generalized episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2008 On a Generalization of Standard Episturmian Morphisms
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory2
2008 On different generalizations of episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002, Luca Q. Zamboni
Theor. Comput. Sci.2
2008 Rich, Sturmian, and trapezoidal words
Aldo de Luca, Amy Glen, Luca Q. Zamboni
Theor. Comput. Sci.1
2006 Pseudopalindrome closure operators in free monoids
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.1
2006 Some characterizations of finite Sturmian words
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.1
2005 Central Sturmian Words: Recent Developments
Arturo Carpi, Aldo de Luca
Developments in Language Theory2
2005 Palindromes in Sturmian Words
Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory1
2005 Completions in measure of languages and related combinatorial problems
Arturo Carpi, Aldo de Luca
Theor. Comput. Sci.2
2005 Codes of central Sturmian words
Arturo Carpi, Aldo de Luca
Theor. Comput. Sci.2
2005 Preface
Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg
Theor. Comput. Sci.1
2003 Semiperiodic words and root-conjugacy
Arturo Carpi, Aldo de Luca
Theor. Comput. Sci.2
2002 Words, univalent factors, and boxes
Arturo Carpi, Aldo de Luca, Stefano Varricchio
Acta Informatica2
2002 A combinatorial property of the factor poset of a word
Arturo Carpi, Aldo de Luca
Inf. Process. Lett.2
2002 Some combinatorial results on Bernoulli sets and codes
Aldo de Luca
Theor. Comput. Sci.1
2001 Periodic-like words, periodicity, and boxes
Arturo Carpi, Aldo de Luca
Acta Informatica2
2001 Special Factors and Uniqueness Conditions in Rational Trees
Arturo Carpi, Aldo de Luca, Stefano Varricchio
Theory Comput. Syst.2
2001 Words and special factors
Arturo Carpi, Aldo de Luca
Theor. Comput. Sci.2
2000 Periodic-Like Words
Arturo Carpi, Aldo de Luca
MFCS2
2000 Special Factors, Periodicity, and an Application to Sturmian Words
Arturo Carpi, Aldo de Luca
Acta Informatica2
1999 Special factors in some combinational structures
Arturo Carpi, Aldo de Luca, Stefano Varricchio
Developments in Language Theory2
1999 On the Combinatorics of Finite Words
Aldo de Luca
Theor. Comput. Sci.1
1998 A Conjecture on Continued Fractions
Aldo de Luca
Theor. Comput. Sci.1
1997 Sturmian Words, Lyndon Words and Trees
Jean Berstel, Aldo de Luca
Theor. Comput. Sci.2
1997 Standard Sturmian Morphisms
Aldo de Luca
Theor. Comput. Sci.1
1997 Sturmian Words: Structure, Combinatorics, and Their Arithmetics
Aldo de Luca
Theor. Comput. Sci.1
1996 On Standard Sturmian Morphisms
Aldo de Luca
ICALP1
1995 A Division Property of the Fibonacci Word
Aldo de Luca
Inf. Process. Lett.1
1994 Well Quasi-Orders and Regular Languages
Aldo de Luca, Stefano Varricchio
Acta Informatica1
1994 On Bispecial Factors of the Thue-Morse Word
Aldo de Luca, Licia Mione
Inf. Process. Lett.1
1994 Some Combinatorial Properties of Sturmian Words
Aldo de Luca, Filippo Mignosi
Theor. Comput. Sci.1
1992 Some Regularity Conditions Based on Well Quasi-Orders
Aldo de Luca, Stefano Varricchio
LATIN1
1992 On Finitely Recognizable Semigroups
Aldo de Luca, Stefano Varricchio
Acta Informatica1
1992 On Noncounting Regular Classes
Aldo de Luca, Stefano Varricchio
Theor. Comput. Sci.1
1991 Finiteness and Iteration Conditions for Semigroups
Aldo de Luca, Stefano Varricchio
Theor. Comput. Sci.1
1990 On Non-Counting Regular Classes
Aldo de Luca, Stefano Varricchio
ICALP1
1990 Non-Repetitive Words Relative to a Rewriting System
Arturo Carpi, Aldo de Luca
Theor. Comput. Sci.2
1989 Factorial Languages Whose Growth Function is Quadratically Upper Bounded
Aldo de Luca, Stefano Varricchio
Inf. Process. Lett.1
1989 Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups
Aldo de Luca, Stefano Varricchio
Theor. Comput. Sci.1
1988 Test Sets for Languages of Infinite Words
Aldo de Luca, M. Pelagalli, Stefano Varricchio
Inf. Process. Lett.1
1988 On the Factors of the Thue-Morse Word on Three Symbols
Aldo de Luca, Stefano Varricchio
Inf. Process. Lett.1
1986 A decision procedure on partially commutative free monoids
Aldo de Luca, Antonio Massarotti
Discret. Appl. Math.1
1986 Square-Free Words on Partially Commutative Free Monoids
Arturo Carpi, Aldo de Luca
Inf. Process. Lett.2
1986 Star-Free Sets of Integers
Aldo de Luca, Antonio Restivo
Theor. Comput. Sci.1
1984 Representations lf Integers and Language Theory
Aldo de Luca, Antonio Restivo
MFCS1
1983 On the Centers of a Language
Aldo de Luca, Antonio Restivo, Sergio Salemi
Theor. Comput. Sci.1
1981 A Combinatorial Property of the Fibonacci Words
Aldo de Luca
Inf. Process. Lett.1
1980 On Some Properties of Local Testability
Aldo de Luca, Antonio Restivo
ICALP1
1980 A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
Aldo de Luca, Antonio Restivo
Inf. Control.1
1980 Minimal Complete Sets of Words
Jean-Marie Boë, Aldo de Luca, Antonio Restivo
Theor. Comput. Sci.2
1980 On Some Properties of Very Pure Codes
Aldo de Luca, Antonio Restivo
Theor. Comput. Sci.1
1979 Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup
Aldo de Luca, Antonio Restivo
MFCS1
1978 A Combinatorial Property of Finite Prefix Codes
Aldo de Luca
Inf. Control.1
1977 Measures of Ambiguity in the Analysis of Complex Systems
Aldo de Luca, Settimo Termini
MFCS1
1976 A Note on Variable Length Codes
Aldo de Luca
Inf. Control.1
1974 Entropy of L-Fuzzy Sets
Aldo de Luca, Settimo Termini
Inf. Control.1
1973 Fuzzy Sets and Decision Theory
Renato M. Capocelli, Aldo de Luca
Inf. Control.2
1972 A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory
Aldo de Luca, Settimo Termini
Inf. Control.1