The following pages link to Francine Blanchet-Sadri (Q591667):
Displayed 50 items.
- 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)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Equations on the semidirect product of a finite semilattice by a finite commutative monoid (Q1328448) (← links)
- Equations on semidirect products of commutative semigroups (Q1362888) (← links)
- On a product of finite monoids (Q1393042) (← links)
- Notions of automaticity in semigroups. (Q1402893) (← links)
- Some properties of invertible substitutions of rank \(d\), and higher dimensional substitutions. (Q1412398) (← links)
- On the transcendence of real numbers with a regular expansion. (Q1415365) (← links)
- Combings of groups and the grammar of reparameterization. (Q1422174) (← links)
- The homomorphism problem for trace monoids. (Q1426045) (← links)
- Periodicity on partial words (Q1433084) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices (Q1704577) (← links)
- Finite automata of polynomial growth do not generate a free group. (Q1768261) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Two-state Mealy automata of intermediate growth over a two-letter alphabet (Q1810168) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- Local periods and binary partial words: an algorithm (Q1884922) (← links)
- Some logical characterizations of the dot-depth hierarchy and applications (Q1900936) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- Ancestors graph and an upper bound for the subword complexity function (Q1935789) (← links)
- Deciding representability of sets of words of equal length (Q1939274) (← links)
- The subword complexity of polynomial subsequences of the Thue-Morse sequence (Q2143625) (← links)
- New algebraic and geometric constructs arising from Fibonacci numbers. (Q2156890) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Automatic \(\beta\)-expansions of formal Laurent series over finite fields (Q2253090) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- On the state complexity of partial word DFAs (Q2344741) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Computing minimum length representations of sets of words of uniform length (Q2355702) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- The smallest Mealy automaton of intermediate growth. (Q2368724) (← links)
- Automatic semigroups and categories. (Q2368995) (← links)
- Some properties of the Tribonacci sequence (Q2372431) (← links)
- An analogue of the Thue-Morse sequence (Q2372874) (← links)
- Deterministic concatenation product of languages recognized by finite idempotent monoids. (Q2373421) (← links)