A connection between palindromic and factor complexity using return words M Bucci, A De Luca, A Glen, LQ Zamboni arXiv preprint arXiv:0802.1332, 2008 | 59 | 2008 |
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 | 46 | 2009 |
BioGrakn: A knowledge graph-based semantic database for biomedical sciences A Messina, H Pribadi, J Stichbury, M Bucci, S Klarman, A Urso Complex, Intelligent, and Software Intensive Systems: Proceedings of the …, 2018 | 39 | 2018 |
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 | 27 | 2013 |
Rich and periodic-like words M Bucci, A de Luca, A De Luca International Conference on Developments in Language Theory, 145-155, 2009 | 24 | 2009 |
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 | 18 | 2016 |
On a family of morphic images of Arnoux-Rauzy words M Bucci, A De Luca International Conference on Language and Automata Theory and Applications …, 2009 | 11 | 2009 |
On θ-episturmian words M Bucci, A De Luca, A De Luca, LQ Zamboni European Journal of Combinatorics 30 (2), 473-479, 2009 | 11 | 2009 |
Greedy palindromic lengths M Bucci, G Richomme International Journal of Foundations of Computer Science 29 (03), 331-356, 2018 | 9 | 2018 |
On additive properties of sets defined by the Thue–Morse word M Bucci, N Hindman, S Puzynina, LQ Zamboni Journal of Combinatorial Theory, Series A 120 (6), 1235-1245, 2013 | 8 | 2013 |
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 |
Infinite words with well distributed occurrences Ĺ Balková, M Bucci, A De Luca, S Puzynina Combinatorics on Words: 9th International Conference, WORDS 2013, Turku …, 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 | 6 | 2012 |
Central sets generated by uniformly recurrent words M Bucci, S Puzynina, LQ Zamboni Ergodic Theory and Dynamical Systems 35 (3), 714-736, 2015 | 5 | 2015 |
Reversible Christoffel factorizations M Bucci, A De Luca, LQ Zamboni Theoretical Computer Science 495, 17-24, 2013 | 2 | 2013 |
On the number of episturmian palindromes M Bucci, A de Luca, A De Luca Theoretical computer science 411 (40-42), 3668-3684, 2010 | 2 | 2010 |
Central sets defined by words of low factor complexity M Bucci, S Puzynina, LQ Zamboni arXiv preprint arXiv:1110.4225, 2011 | 1 | 2011 |
On a generalization of standard episturmian morphisms M Bucci, A de Luca, A De Luca Developments in Language Theory: 12th International Conference, DLT 2008 …, 2008 | 1 | 2008 |