| 2009 |
|---|
| 30 | EE | Francine Blanchet-Sadri,
Emily Allen,
Cameron Byrum,
Robert Mercas:
How Many Holes Can an Unbordered Partial Word Contain?.
LATA 2009: 176-187 |
| 29 | EE | Francine Blanchet-Sadri,
Robert Mercas,
Abraham Rashin,
Elara Willett:
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.
LATA 2009: 188-199 |
| 28 | EE | Francine Blanchet-Sadri,
Robert Mercas,
Geoffrey Scott:
A generalization of Thue freeness for partial words.
Theor. Comput. Sci. 410(8-10): 793-800 (2009) |
| 27 | EE | Francine Blanchet-Sadri,
Raphael M. Jungers,
Justin Palumbo:
Testing avoidability on sets of partial words is hard.
Theor. Comput. Sci. 410(8-10): 968-972 (2009) |
| 2008 |
|---|
| 26 | EE | Francine Blanchet-Sadri,
Deepak Bal,
Gautam Sisodia:
Graph connectivity, partial words, and a theorem of Fine and Wilf.
Inf. Comput. 206(5): 676-693 (2008) |
| 25 | EE | Francine Blanchet-Sadri,
Kevin Corcoran,
Jenell Nyberg:
Periodicity properties on partial words.
Inf. Comput. 206(9-10): 1057-1064 (2008) |
| 24 | EE | Francine Blanchet-Sadri,
L. Bromberg,
K. Zipple:
Remarks on Two Nonstandard Versions of Periodicity in Words.
Int. J. Found. Comput. Sci. 19(6): 1439-1448 (2008) |
| 2007 |
|---|
| 23 | EE | Francine Blanchet-Sadri,
N. C. Brownstein,
Justin Palumbo:
Two Element Unavoidable Sets of Partial Words.
Developments in Language Theory 2007: 96-107 |
| 22 | EE | Francine Blanchet-Sadri,
Joshua D. Gafni,
Kevin H. Wilson:
Correlations of Partial Words.
STACS 2007: 97-108 |
| 21 | EE | Francine Blanchet-Sadri,
Arundhati R. Anavekar:
Testing primitivity on partial words.
Discrete Applied Mathematics 155(3): 279-287 (2007) |
| 20 | EE | Francine Blanchet-Sadri,
Nathan D. Wetzler:
Partial words and the critical factorization theorem revisited.
Theor. Comput. Sci. 385(1-3): 179-192 (2007) |
| 2006 |
|---|
| 19 | EE | Francine Blanchet-Sadri,
D. Dakota Blair,
Rebeca V. Lewis:
Equations on Partial Words.
MFCS 2006: 167-178 |
| 2005 |
|---|
| 18 | EE | Francine Blanchet-Sadri:
Primitive partial words.
Discrete Applied Mathematics 148(3): 195-213 (2005) |
| 17 | EE | Lili Zhang,
Francine Blanchet-Sadri:
Algorithms for approximate k-covering of strings.
Int. J. Found. Comput. Sci. 16(6): 1231-1251 (2005) |
| 16 | EE | Francine Blanchet-Sadri,
S. Duncan:
Partial words and the critical factorization theorem.
J. Comb. Theory, Ser. A 109(2): 221-245 (2005) |
| 2004 |
|---|
| 15 | EE | Francine Blanchet-Sadri,
Ajay Chriscoe:
Local periods and binary partial words: an algorithm.
Theor. Comput. Sci. 314(1-2): 189-216 (2004) |
| 14 | EE | Francine Blanchet-Sadri:
Codes, orderings, and partial words.
Theor. Comput. Sci. 329(1-3): 177-202 (2004) |
| 2002 |
|---|
| 13 | EE | Francine Blanchet-Sadri,
Robert A. Hegstrom:
Partial words and a theorem of Fine and Wilf revisited.
Theor. Comput. Sci. 270(1-2): 401-419 (2002) |
| 12 | | Francine Blanchet-Sadri,
D. K. Luhmann:
Conjugacy on partial words.
Theor. Comput. Sci. 289(1): 297-312 (2002) |
| 2001 |
|---|
| 11 | | Francine Blanchet-Sadri:
On unique, multiset, set decipherability of three-word codes.
IEEE Transactions on Information Theory 47(5): 1745-1757 (2001) |
| 1998 |
|---|
| 10 | EE | Francine Blanchet-Sadri:
Trees, Congruences and Varieties of Finite Semigroups.
Discrete Applied Mathematics 86(2-3): 157-179 (1998) |
| 1997 |
|---|
| 9 | | Francine Blanchet-Sadri:
On the Semidirect Product of the Pseudovariety of Semilattices by a Locally Finite Pseudovariety of Groups.
ITA 31(3): 237-250 (1997) |
| 1996 |
|---|
| 8 | EE | Francine Blanchet-Sadri:
Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy.
Discrete Applied Mathematics 68(1-2): 33-71 (1996) |
| 7 | | Francine Blanchet-Sadri:
On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids.
ITA 30(5): 457-482 (1996) |
| 1995 |
|---|
| 6 | | Francine Blanchet-Sadri:
Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k.
ITA 29(3): 157-170 (1995) |
| 1994 |
|---|
| 5 | | Francine Blanchet-Sadri:
On a complete set of generators for dot-depth two.
Discrete Applied Mathematics 50(1): 1-25 (1994) |
| 4 | | Francine Blanchet-Sadri:
Equations and Monoid Varieties of Dot-Depth One and Two.
Theor. Comput. Sci. 123(2): 239-258 (1994) |
| 1992 |
|---|
| 3 | EE | Francine Blanchet-Sadri:
Games, Equations and Dot-Depth Two Monoids.
Discrete Applied Mathematics 39(2): 99-111 (1992) |
| 2 | | Francine Blanchet-Sadri:
The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable.
Int. J. Found. Comput. Sci. 3(4): 419-442 (1992) |
| 1990 |
|---|
| 1 | | Francine Blanchet-Sadri:
On dot-depth two.
ITA 24: 521-530 (1990) |
