4 citations · 21 across the 13 of their papers we have counts for
7 papers · 1 filter
Computing the k-binomial complexity of generalized Thue--Morse words
M. Golafshan, M. Rigo, M. Whiteland
Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an…
Introducing q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo, Markus A. Whiteland
Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements…
On extended boundary sequences of morphic and Sturmian words
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the th term of the -boundary sequence of an infinite word is the finite set of pairs o…
Characterizations of families of morphisms and words via binomial complexities
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Two words are -binomially equivalent if each subword of length at most occurs the same number of times in both words. The -binomial complexity of an infinite word is a co…
On Abelian Closures of Infinite Non-binary Words
Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
Two finite words and are called abelian equivalent if each letter occurs equally many times in both and . The abelian closure of an infinit…
Abelian Closures of Infinite Binary Words
Svetlana Puzynina, Markus A. Whiteland
Two finite words and are called Abelian equivalent if each letter occurs equally many times in both and . The abelian closure of (the shift…
On cardinalities of -abelian equivalence classes
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao +1
Two words and are -abelian equivalent if, for each word of length at most , occurs equally many times as a factor in both and . The notion of -abeli…