Suivre
Francine Blanchet-Sadri
Francine Blanchet-Sadri
Adresse e-mail validée de uncg.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Algorithmic combinatorics on partial words
F Blanchet-Sadri
Chapman and Hall/CRC, 2007
1452007
Partial words and a theorem of Fine and Wilf revisited
F Blanchet-Sadri, RA Hegstrom
Theoretical Computer Science 270 (1-2), 401-419, 2002
942002
Primitive partial words
F Blanchet-Sadri
Discrete Applied Mathematics 148 (3), 195-213, 2005
652005
Periodicity on partial words
F Blanchet-Sadri
Computers & Mathematics with Applications 47 (1), 71-82, 2004
642004
Conjugacy on partial words
F Blanchet-Sadri, DK Luhmann
Theoretical Computer Science 289 (1), 297-312, 2002
462002
Codes, orderings, and partial words
F Blanchet-Sadri
Theoretical Computer Science 329 (1-3), 177-202, 2004
452004
Partial words and the critical factorization theorem
F Blanchet-Sadri, S Duncan
Journal of Combinatorial Theory, Series A 109 (2), 221-245, 2005
392005
Equations and monoid varieties of dot-depth one and two
F Blanchet-Sadri
Theoretical computer science 123 (2), 239-258, 1994
361994
Local periods and binary partial words: an algorithm
F Blanchet-Sadri, A Chriscoe
Theoretical Computer Science 314 (1-2), 189-216, 2004
352004
Games, equations and the dot-depth hierarchy
F Blanchet-Sadri
Computers & Mathematics with Applications 18 (9), 809-822, 1989
341989
A generalization of Thue freeness for partial words
F Blanchet-Sadri, R Mercaş, G Scott
Theoretical Computer Science 410 (8-10), 793-800, 2009
312009
Counting distinct squares in partial words
F Blanchet-Sadri, R Mercaş, G Scott
Acta Cybernetica 19 (2), 465-477, 2009
302009
Some logical characterizations of the dot-depth hierarchy and applications
F Blanchetsadri
Journal of Computer and System Sciences 51 (2), 324-337, 1995
27*1995
Multiset and set decipherable codes
F Blanchet-Sadri, C Morgan
Computers & Mathematics with Applications 41 (10-11), 1257-1262, 2001
262001
Equations and dot-depth one
F Blanchet-Sadri
Semigroup Forum 47, 305-317, 1993
261993
Strict bounds for pattern avoidance
F Blanchet-Sadri, B Woodhouse
Theoretical Computer Science 506, 17-28, 2013
242013
Graph connectivity, partial words, and a theorem of Fine and Wilf
F Blanchet-Sadri, D Bal, G Sisodia
Information and Computation 206 (5), 676-693, 2008
232008
Abelian complexity of fixed point of morphism 0↦ 012, 1↦ 02, 2↦ 1
F Blanchet-Sadri, JD Currie, N Rampersad, N Fox
Integers, 2014
222014
Unavoidable sets of partial words
F Blanchet-Sadri, NC Brownstein, A Kalcic, J Palumbo, T Weyand
Theory of Computing Systems 45, 381-406, 2009
222009
A periodicity result of partial words with one hole
F Blanchet-Sadri
Computers & Mathematics with Applications 46 (5-6), 813-820, 2003
212003
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20