| Pseudopalindrome closure operators in free monoids A de Luca, A De Luca Theoretical Computer Science 362 (1-3), 282-300, 2006 | 94 | 2006 |
| A connection between palindromic and factor complexity using return words M Bucci, A De Luca, A Glen, LQ Zamboni Advances in Applied Mathematics 42, 60–74, 2009 | 55 | 2009 |
| A new characteristic property of rich words M Bucci, A De Luca, A Glen, LQ Zamboni Theoretical Computer Science 410 (30-32), 2860-2863, 2009 | 47 | 2009 |
| On different generalizations of episturmian words M Bucci, A de Luca, A De Luca, LQ Zamboni Theoretical Computer Science 393 (1-3), 23-36, 2008 | 29 | 2008 |
| Enumeration and structure of trapezoidal words M Bucci, A De Luca, G Fici Theoretical Computer Science 468, 12-22, 2013 | 26 | 2013 |
| Combinatorial properties of Sturmian palindromes A de Luca, A De Luca International Journal of Foundations of Computer Science 17 (3), 557-573, 2006 | 25 | 2006 |
| Rich and periodic-like words M Bucci, A de Luca, A De Luca Developments in Language Theory, 145-155, 2009 | 24 | 2009 |
| Some characterizations of finite Sturmian words A De Luca, A De Luca Theoretical computer science 356 (1-2), 118-125, 2006 | 23 | 2006 |
| On some problems related to palindrome closure M Bucci, A De Luca, A De Luca, LQ Zamboni RAIRO-Theoretical Informatics and Applications 42 (4), 679-700, 2008 | 21 | 2008 |
| Aperiodic pseudorandom number generators based on infinite words Ľ Balková, M Bucci, A De Luca, J Hladký, S Puzynina Theoretical Computer Science 647, 85–100, 2016 | 17 | 2016 |
| Palindromes in Sturmian words A de Luca, A De Luca Developments in Language Theory, 199-208, 2005 | 16 | 2005 |
| Open and closed prefixes of Sturmian words A De Luca, G Fici Combinatorics on Words: 9th International Conference, WORDS 2013, Turku …, 2013 | 11 | 2013 |
| On θ-episturmian words M Bucci, A De Luca, A De Luca, LQ Zamboni European Journal of Combinatorics 30 (2), 473-479, 2009 | 11 | 2009 |
| On a family of morphic images of Arnoux-Rauzy words M Bucci, A De Luca Language and Automata Theory and Applications, 259-266, 2009 | 11 | 2009 |
| Characteristic morphisms of generalized episturmian words M Bucci, A de Luca, A De Luca Theoretical computer science 410 (30-32), 2840-2859, 2009 | 8 | 2009 |
| The sequence of open and closed prefixes of a Sturmian word A De Luca, G Fici, LQ Zamboni Advances in Applied Mathematics 90, 27-45, 2017 | 6 | 2017 |
| Sturmian words and the Stern sequence A de Luca, A De Luca Theoretical Computer Science 581, 26-44, 2015 | 6 | 2015 |
| Infinite Words with Well Distributed Occurrences Ľ Balková, M Bucci, A De Luca, S Puzynina WORDS 2013, LNCS 8079, 46–57, 2013 | 6 | 2013 |
| Some characterizations of Sturmian words in terms of the lexicographic order M Bucci, A De Luca, LQ Zamboni Fundamenta Informaticae 116 (1-4), 25-33, 2012 | 5 | 2012 |
| Reversible Christoffel factorizations M Bucci, A De Luca, LQ Zamboni Theoretical Computer Science 495, 17-24, 2013 | 4 | 2013 |
Michelangelo BucciPostDoc Researcher, University of Liège在 unina.it 的电子邮件经过验证
