Manon Stipulanti

activity

20172026

most citedGeneralized Pascal triangle for binomial coefficients of words

14 citations · 33 across the 30 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

cs.FL2018

Cobham's Theorem and Automaticity

Lucas Mol, Narad Rampersad, Jeffrey Shallit +1

We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$ -automatic sequence an…

math.CO2018

The Formal Inverse of the Period-Doubling Sequence

Narad Rampersad, Manon Stipulanti

If $p$ is a prime number, consider a $p$ -automatic sequence $(u_{n})_{n \geq 0}$ , and let $U (X) = \sum_{n \geq 0} u_{n} X^{n} \in F_{p} [[X]]$ be its generating function. Assume that t…

math.CO2018★ 1 cited

Nyldon words

Émilie Charlier, Manon Philibert, Manon Stipulanti

The Chen-Fox-Lyndon theorem states that every finite word over a fixed alphabet can be uniquely factorized as a lexicographically nonincreasing sequence of Lyndon words. This theor…

math.CO2018

Convergence of Pascal-Like Triangles in Parry-Bertrand Numeration Systems

Manon Stipulanti

We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word app…