The following pages link to Francine Blanchet-Sadri (Q591667):
Displayed 50 items.
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Squares in partial words (Q2440165) (← links)
- Counting minimal semi-Sturmian words (Q2446875) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Some decidability and undecidability results on Green's relations for automatic monoids. (Q2464344) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Two-letter group codes that preserve aperiodicity of inverse finite automata. (Q2480773) (← links)
- Primitive partial words (Q2486065) (← links)
- Uniform decision problems for automatic semigroups. (Q2509285) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Recurrence in infinite partial words (Q2637347) (← links)
- Recurrent Partial Words (Q2789516) (← links)
- Longest Common Extensions in Partial Words (Q2798218) (← links)
- (Q2819388) (← links)
- Deciding Representability of Sets of Words of Equal Length in Polynomial Time (Q2870014) (← links)
- Abelian pattern avoidance in partial words (Q2874640) (← links)
- Computing the Partial Word Avoidability Indices of Ternary Patterns (Q2876575) (← links)
- Abelian Pattern Avoidance in Partial Words (Q2912721) (← links)
- Border Correlations, Lattices, and the Subgraph Component Polynomial (Q2946042) (← links)
- Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings (Q2965481) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- Unary Pattern Avoidance in Partial Words Dense with Holes (Q3004576) (← links)
- (Q3018955) (← links)
- FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS (Q3056274) (← links)
- Periods in Partial Words: An Algorithm (Q3111640) (← links)
- (Q3113686) (← links)
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids (Q3126014) (← links)
- Squares in Binary Partial Words (Q3167513) (← links)
- Deciding Representability of Sets of Words of Equal Length (Q3167575) (← links)
- Minimal Partial Languages and Automata (Q3192256) (← links)
- Squareable Words (Q3451095) (← links)
- (Q3527014) (← links)
- Equations on partial words (Q3549287) (← links)
- Abelian Square-Free Partial Words (Q3564852) (← links)
- Avoidable Binary Patterns in Partial Words (Q3564853) (← links)
- Binary De Bruijn Partial Words with One Hole (Q3569070) (← links)
- Correlations of Partial Words (Q3590925) (← links)
- How Many Holes Can an Unbordered Partial Word Contain? (Q3618579) (← links)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580) (← links)
- On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
- A note on the number of squares in a partial word with one hole (Q3653094) (← links)
- THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (Q4032922) (← links)
- On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups (Q4361576) (← links)
- On unique, multiset, and set decipherability of three-word codes (Q4544619) (← links)
- Minimal partial languages and automata (Q4602380) (← links)
- Pattern Avoidance in Partial Words Dense with Holes. (Q4609171) (← links)