48 citations · 248 across the 18 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.FL2022★ 1 cited
Some Results on Digital Segments and Balanced Words
Alessandro De Luca, Gabriele Fici
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…
cs.DS2022★ 2 cited
Maximal Closed Substrings
Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici +1
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a \emph{maximal closed substring} (MCS), w…
cs.DM2022★ 25 cited
On the Lie complexity of Sturmian words
Alessandro De Luca, Gabriele Fici
Bell and Shallit recently introduced the Lie complexity of an infinite word as the function counting for each length the number of conjugacy classes of words whose elements are…