48 citations · 175 across the 8 of their papers we have counts for
10 papers
Greedy palindromic lengths
Michelangelo Bucci, Gwenaël Richomme
In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose pal…
Aperiodic pseudorandom number generators based on infinite words
Lubomira Balkova, Michelangelo Bucci, Alessandro De Luca +2
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We i…
On additive properties of sets defined by the Thue-Morse word
Michelangelo Bucci, Neil Hindman, Svetlana Puzynina +1
In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset of $\nats$ is called {\it -summable} (where $k\in\ben$) if c…
Central sets generated by uniformly recurrent words
Michelangelo Bucci, Svetlana Puzynina, Luca Q. Zamboni
A subset of $\nats$ is called an IP-set if contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \nats} $ of natural numbers. Central sets, firs…
Reversible Christoffel factorizations
Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni
We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two S…
Some characterizations of Sturmian words in terms of the lexicographic order
Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni
In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their factors.
Enumeration and Structure of Trapezoidal Words
Michelangelo Bucci, Alessandro De Luca, Gabriele Fici
Trapezoidal words are words having at most distinct factors of length for every . They therefore encompass finite Sturmian words. We give combinatorial characteri…
Central sets defined by words of low factor complexity
Michelangelo Bucci, Svetlana Puzynina, Luca Q. Zamboni
A subset of is called an IP-set if contains all finite sums of distinct terms of some infinite sequence of natural numbers. Central…
A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca, Amy Glen +1
Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer in arXiv:0801.1656, rich words constitute a new class of finite and infinite…
A connection between palindromic and factor complexity using return words
Michelangelo Bucci, Alessandro De Luca, Amy Glen +1
In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes…