1 citations · 2 across the 5 of their papers we have counts for
4 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…
Automatic Abelian Complexities of Parikh-Collinear Fixed Points
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference…
q-Parikh Matrices and q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo, Markus A. Whiteland
We have introduced a q-deformation, i.e., a polynomial in q with natural coefficients, of the binomial coefficient of two finite words u and v counting the number of occurrences of…
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…