Welcome!
I am a researcher in (theoretical) Computer Science at the Università di Napoli Federico II. I am also participating in the FiDiPro project Words, Numbers and Tilings with Applications based at the University of Turku, Finland.
I am mostly interested in combinatorics on words (MSC 2010: 68R15) and related topics such as automata and formal language theory, algebraic and enumerative combinatorics in general.
Résumé: English / Italian (by INdAM).
Refereed Publications
Journal papers:
- M. Bucci, A. de Luca, and A. De Luca. On the number of episturmian palindromes. Theoretical Computer Science 411 (2010) 3668–3684. [preprint]
- M. Bucci, A. de Luca, and A. De Luca. Characteristic morphisms of generalized episturmian words. Theoretical Computer Science 410 (2009) 2840–2859. [preprint]
- M. Bucci, A. De Luca, A. Glen, and L. Q. Zamboni. A new characteristic property of rich words. Theoretical Computer Science 410 (2009) 2860–2863. [preprint]
- M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On θ-episturmian words. European Journal of Combinatorics 30 (2009) 473–479. [preprint]
- M. Bucci, A. De Luca, A. Glen, and L. Q. Zamboni. A connection between palindromic and factor complexity using return words. Advances in Applied Mathematics 42 (2009) 60–74. [arXiv]
- M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On different generalizations of episturmian words. Theoretical Computer Science 393 (2008) 23–36. [preprint]
- M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On some problems related to palindrome closure. Theoretical Informatics and Applications 42 (2008) 679–700. [preprint]
- A. de Luca and A. De Luca. Pseudopalindrome closure operators in free monoids. Theoretical Computer Science 362 (2006) 282–300. [preprint]
- A. de Luca and A. De Luca. Combinatorial properties of Sturmian palindromes. International Journal of Foundations of Computer Science 17 (2006) 557–573. [preprint]
- A. de Luca and A. De Luca. Some characterizations of finite Sturmian words. Theoretical Computer Science 356 (2006) 118–125. [preprint]
Ph.D. Thesis:
- A. De Luca. Combinatorial aspects of Sturmian sequences and their generalizations. Università degli Studi di Napoli Federico II (2008).
Conference papers:
- M. Bucci, A. de Luca, and A. De Luca. Rich and Periodic-Like Words. In V. Diekert and D. Nowotka, editors, Developments in Language Theory, vol. 5583 of Lecture Notes in Computer Science, Springer, pp. 145–155. [preprint]
- M. Bucci and A. De Luca. On a Family of Morphic Images of Arnoux-Rauzy Words. In A. H. Dediu, A. M. Ionescu, and C. Martín-Vide, editors, Language and Automata Theory and Applications, vol. 5457 (2009) of Lecture Notes in Computer Science, Springer, pp. 259–266. [preprint]
- M. Bucci, A. de Luca, and A. De Luca. On a Generalization of Standard Episturmian Morphisms. In M. Ito, M. Toyama (eds.), Developments in Language Theory, vol. 5257 (2008) of Lecture Notes in Computer Science, Springer, pp. 158–169. [preprint]
- M. Bucci, A. De Luca, A. Glen, and L. Q. Zamboni. A new characteristic
property of rich words. In Local Proceedings of the 12th Journées Montoises d'Informatique Théorique (2008), 6 pages. [arXiv]
- M. Bucci and A. De Luca. Special factors and images of Arnoux-Rauzy words. In Local Proceedings of the 12th Journées Montoises d'Informatique Théorique (2008), 7 pages. [preprint]
- M. Bucci, A. de Luca, and A. De Luca. Some generalizations of
episturmian words and morphisms. In P. Arnoux, N. Bédaride, J.
Cassaigne (eds.), Proceedings of WORDS 2007, pp. 100–108. [preprint]
- A. de Luca and A. De Luca. Palindromes in Sturmian Words. In Developments in Language Theory, vol. 3572 (2005) of Lecture Notes in Computer Science, Springer, pp. 199–208. [preprint]
