The following pages link to Francine Blanchet-Sadri (Q591667):
Displayed 24 items.
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$ (Q4850322) (← links)
- A Graph Polynomial Approach to Primitivity (Q4910454) (← links)
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (Q4910455) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- A note on constructing infinite binary words with polynomial subword complexity (Q4928768) (← links)
- (Q5016356) (← links)
- (Q5016359) (← links)
- Avoiding Abelian Powers in Partial Words (Q5199954) (← links)
- Recurrent Partial Words and Representable Sets. (Q5267519) (← links)
- On the Asymptotic Abelian Complexity of Morphic Words (Q5300832) (← links)
- Strict Bounds for Pattern Avoidance (Q5300833) (← links)
- (Q5306171) (← links)
- Algorithmic Combinatorics on Partial Words (Q5310364) (← links)
- Partial Word DFAs (Q5327481) (← links)
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf (Q5397716) (← links)
- Computing Depths of Patterns (Q5404910) (← links)
- (Q5408177) (← links)
- Two Element Unavoidable Sets of Partial Words (Q5428223) (← links)
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS (Q5714671) (← links)
- (Q5740407) (← links)
- On dot-depth two (Q5750405) (← links)
- Equations on Partial Words (Q5756726) (← links)
- Partial words and a theorem of Fine and Wilf revisited (Q5958314) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)