The following pages link to Francine Blanchet-Sadri (Q591667):
Displaying 50 items.
- Unavoidable regularities in long words with bounded number of symbol occurrences (Q386431) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Strict bounds for pattern avoidance (Q393106) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Weakly unambiguous morphisms (Q442106) (← links)
- Periodicity algorithms and a conjecture on overlaps in partial words (Q442242) (← links)
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- An abelian periodicity lemma (Q507407) (← links)
- Inconstancy of finite and infinite sequences (Q533867) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- On higher order homological finiteness of rewriting systems. (Q557065) (← links)
- Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
- From monomials to words to graphs. (Q598451) (← links)
- Fixed points of endomorphisms over special confluent rewriting systems. (Q604812) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- The Ehrenfeucht-Silberger problem (Q662035) (← links)
- Normal forms under Simon's congruence (Q667852) (← links)
- Multidimensional extension of the Morse-Hedlund theorem (Q691591) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- Finiteness and Dehn functions of automatic monoids having directed fellow traveller property. (Q731326) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- Erratum to: ``Avoidable binary patterns in partial words'' (Q766184) (← links)
- Combinatorial properties of smooth infinite words (Q818144) (← links)
- Notions of hyperbolicity in monoids. (Q846368) (← links)
- A geometric characterization of automatic semigroups (Q861269) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Border correlations of partial words (Q987385) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Geometry of the common dynamics of flipped Pisot substitutions (Q1022356) (← links)
- Counting powers of words in monoids. (Q1024329) (← links)
- Unbordered partial words (Q1028413) (← links)
- Notions of automaticity in semigroups. (Q1402893) (← links)
- Combings of groups and the grammar of reparameterization. (Q1422174) (← links)
