50 citations · 416 across the 42 of their papers we have counts for
11 papers · 1 filter
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…
Abelian Combinatorics on Words: a Survey
Gabriele Fici, Svetlana Puzynina
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of c…
Abelian-Square-Rich Words
Gabriele Fici, Filippo Mignosi, Jeffrey Shallit
An abelian square is the concatenation of two words that are anagrams of one another. A word of length can contain at most distinct factors, and there exist words of l…
The sequence of open and closed prefixes of a Sturmian word
Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the…
On Prefix Normal Words and Prefix Normal Forms
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
A -prefix normal word is a binary word with the property that no factor has more s than the prefix of the same length; a -prefix normal word is defined analogously. These…
Anti-Powers in Infinite Words
Gabriele Fici, Antonio Restivo, Manuel Silva +1
In combinatorics of words, a concatenation of consecutive equal blocks is called a power of order . In this paper we take a different point of view and define an anti-power…
Words with the Maximum Number of Abelian Squares
Gabriele Fici, Filippo Mignosi
An abelian square is the concatenation of two words that are anagrams of one another. A word of length can contain distinct factors that are abelian squares. We study…
Universal Lyndon Words
Arturo Carpi, Gabriele Fici, Stepan Holub +2
A word over an alphabet is a Lyndon word if there exists an order defined on for which is lexicographically smaller than all of its conjugates (other than itself).…
On the least number of palindromes contained in an infinite word
Gabriele Fici, Luca Q. Zamboni
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic word…
Vertical representation of -words
Jean-Marc Fédou, Gabriele Fici
We present a new framework for dealing with -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe th…
Automata and Differentiable Words
Jean-Marc Fédou, Gabriele Fici
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore…