Alessandro De Luca 0002

dblp:95/1233-2 · DBLP profile ↗
← Back
22ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0003-1704-773XORCID · verified

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

Theory of computation · 20 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2026 Finding maximal closed substrings
Golnaz Badkobeh, Alessandro De Luca 0002, Gabriele Fici, Simon J. Puglisi
Theor. Comput. Sci.2
2025 Dorst-Smeulders Coding for Arbitrary Binary Words
Alessandro De Luca 0002, Gabriele Fici
SPIRE1
2024 Some results on digital segments and balanced words
abstract
We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced words with a zeroes and b ones. We also study minimal non-balanced words.
Alessandro De Luca 0002, Gabriele Fici
Theor. Comput. Sci.1
2022 Maximal Closed Substrings
Golnaz Badkobeh, Alessandro De Luca 0002, Gabriele Fici, Simon J. Puglisi
SPIRE2
2022 On the Lie complexity of Sturmian words
Alessandro De Luca 0002, Gabriele Fici
Theor. Comput. Sci.1
2017 On Christoffel and standard words and their derivatives
Alma D'Aniello, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.3
2016 Aperiodic pseudorandom number generators based on infinite words
L'ubomíra Dvoráková, Michelangelo Bucci, Alessandro De Luca 0002, Jirí Hladký, Svetlana Puzynina
Theor. Comput. Sci.3
2015 Sturmian words and the Stern sequence
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2013 Enumeration and structure of trapezoidal words
Michelangelo Bucci, Alessandro De Luca 0002, Gabriele Fici
Theor. Comput. Sci.2
2013 Reversible Christoffel factorizations
Michelangelo Bucci, Alessandro De Luca 0002, Luca Q. Zamboni
Theor. Comput. Sci.2
2012 Some Characterizations of Sturmian Words in Terms of the Lexicographic Order
abstract
In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their factors.
Michelangelo Bucci, Alessandro De Luca 0002, Luca Q. Zamboni
Fundam. Informaticae2
2012 A generalized palindromization map in free monoids
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2010 On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.3
2009 Rich and Periodic-Like Words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory3
2009 On a Family of Morphic Images of Arnoux-Rauzy Words
Michelangelo Bucci, Alessandro De Luca 0002
LATA2
2009 A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca 0002, Amy Glen, Luca Q. Zamboni
Theor. Comput. Sci.2
2009 Characteristic morphisms of generalized episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.3
2008 On a Generalization of Standard Episturmian Morphisms
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory3
2008 On different generalizations of episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002, Luca Q. Zamboni
Theor. Comput. Sci.3
2006 Pseudopalindrome closure operators in free monoids
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2006 Some characterizations of finite Sturmian words
Aldo de Luca, Alessandro De Luca 0002
Theor. Comput. Sci.2
2005 Palindromes in Sturmian Words
Aldo de Luca, Alessandro De Luca 0002
Developments in Language Theory2