|
|
-
F. Blanchet-Sadri,
"Algorithmic Combinatorics on Partial Words."
Chapman & Hall/CRC Press, Boca Raton, FL, 2007.
|
-
F. Blanchet-Sadri, "Open Problems on Partial Words."
In G. Bel-Enguix, M.D. Jimenez-Lopez, and C. Martin-Vide (Eds.),
New Developments in Formal Languages and Applications, Ch. 2,
Vol. 3, Springer, 2007, pp 11-58.
|
-
F. Blanchet-Sadri and R.A. Hegstrom, "Partial words and a theorem of Fine
and Wilf revisited." Theoretical Computer Science, Vol. 270, No. 1/2, 2002, pp
401-419.
-
F. Blanchet-Sadri and D.K. Luhmann, "Conjugacy on partial words." Theoretical
Computer Science, Vol. 289, No. 1, 2002, pp 297-312.
-
F. Blanchet-Sadri, "Periodicity on partial words." International Journal of Computers and Mathematics
with Applications, Vol. 47, No. 1, 2004, pp 71-82.
-
F. Blanchet-Sadri and A. Chriscoe, "Local periods and binary
partial words:
an algorithm." Theoretical Computer Science, Vol. 314, 2004, pp 189-216.
-
F. Blanchet-Sadri, "Codes, orderings, and partial words." Theoretical Computer
Science, Vol. 329, 2004, pp 177-202.
-
F. Blanchet-Sadri and S. Duncan, "Partial
words and the critical factorization theorem."
Journal of Combinatorial Theory, Series A, Vol. 109, 2005, pp 221-245.
-
F. Blanchet-Sadri, "Primitive partial words." Discrete Applied Mathematics,
Vol. 148, 2005, pp 195-213.
-
F. Blanchet-Sadri and A.R. Anavekar,
"Testing primitivity on partial words."
Discrete Applied Mathematics, Vol. 155, 2007, pp 279-287.
-
F. Blanchet-Sadri and N.D. Wetzler,
"Partial words and the critical factorization theorem revisited." Theoretical Computer Science,
Vol. 385, 2007, pp 179-192.
-
F. Blanchet-Sadri, D. Bal and G. Sisodia,
"Graph connectivity, partial words, and a theorem of Fine and Wilf." Information and Computation,
Vol. 206, 2008, pp 676-693.
-
F. Blanchet-Sadri, K. Corcoran, and J. Nyberg, "Periodicity properties on partial
words." Information and Computation, to appear.
-
F. Blanchet-Sadri, D. Blair and R.V. Lewis,
"Equations on partial words." Theoretical Informatics and Applications, to appear.
-
F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand,
“Unavoidable sets of partial words.” Theory of Computing Systems, to appear.
-
F. Blanchet-Sadri, C.D. Davis, J. Dodge, R. Mercas and M. Moorefield,
"Unbordered partial words." Discrete Applied Mathematics, to appear.
-
F. Blanchet-Sadri, L. Bromberg and K. Zipple,
“Remarks on two nonstandard
versions of periodicity in words.” International Journal of Foundations of Computer Science, to appear.
-
F. Blanchet-Sadri and M. Moorefield, "Pcodes
of partial words."
-
F. Blanchet-Sadri, M. Cucuringu and J. Dodge, "Counting unbordered partial words."
-
F. Blanchet-Sadri and B. Shirey, "Periods, partial words, and
a result of
Guibas and Odlyzko."
-
F. Blanchet-Sadri and M. Cucuringu, "Counting primitive partial words."
-
F. Blanchet-Sadri, E. Clader and O. Simpson,
“Border correlations of partial
words.”
-
F. Blanchet-Sadri, J. Fowler and G. Gramajo,
“Combinatorics on partial word
correlations.”
-
F. Blanchet-Sadri, T. Mandel and G. Sisodia,
“Computing strong periods in partial words.”
-
F. Blanchet-Sadri, R. Mercas and G. Scott,
“A generalization of Thue Freeness for partial words.”
-
F. Blanchet-Sadri, R. Jungers and J. Palumbo,
"Testing avoidability of sets of partial words is hard."
|
-
F. Blanchet-Sadri, D. Blair, and R.V. Lewis,
"Equations on partial words."
In R. Kralovic and P. Urzyczyn (Eds.), MFCS 2006, 31st International Symposium
on Mathematical Foundations of Computer Science, August 28-September 1, 2006, Stara Lesna,
Slovakia, Lecture Notes in Computer
Science, Vol. 4162, Springer-Verlag, Berlin, Heidelberg, 2006, pp 167-178.
-
F. Blanchet-Sadri, J.D. Gafni and K.H. Wilson, “Correlations of partial
words.”
In W. Thomas and P. Weil (Eds.), STACS 2007, 24th International Symposium on Theoretical Aspects of
Computer Science, February 22-24, 2007, Aachen, Germany, Lecture Notes in Computer Science, Vol.
4393,
Springer-Verlag, Berlin, Heidelberg, 2007, pp 97-108.
-
F. Blanchet-Sadri, N.C. Brownstein and J. Palumbo,
“Two element unavoidable sets
of partial words.” In T. Harju, J. Karhumäki, and A. Lepistö (Eds), DLT 2007,
11th International Conference on Developments in Language Theory, July 3-6, 2007, Turku, Finland,
Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp
96-107.
-
F. Blanchet-Sadri, K. Corcoran, and J. Nyberg, "Fine and Wilf's periodicity result on
partial
words and consequences." LATA 2007, 1st International Conference on
Language and Automata Theory
and Applications, March 29-April 4, 2007, Tarragona, Spain, GRLMC Report 35/07, pp 115-126.
-
F. Blanchet-Sadri, T. Oey and T. Rankin,
"Computing weak periods on partial words." AFL 2008, 12th International Conference on Automata and Formal Languages, May
27-30, 2008, Balatonfured, Hungary, to appear.
-
F. Blanchet-Sadri, R. Mercas and G. Scott,
“Counting distinct squares in partial words.” AFL
2008, 12th International Conference on Automata and Formal Languages, May
27-30, 2008, Balatonfured, Hungary, to appear.
|
|
