Francine Blanchet-Sadri
Francine Blanchet-Sadri
Подтвержден адрес электронной почты в домене uncg.edu - Главная страница
Название
Процитировано
Процитировано
Год
Algorithmic combinatorics on partial words
F Blanchet-Sadri
CRC Press, 2007
1282007
Partial words and a theorem of Fine and Wilf revisited
F Blanchet-Sadri, RA Hegstrom
Theoretical Computer Science 270 (1-2), 401-419, 2002
822002
Multiple genome rearrangement by swaps and by element duplications
VY Popov
Theoretical Computer Science 385 (1-3), 115-126, 2007
752007
Primitive partial words
F Blanchet-Sadri
Discrete Applied Mathematics 148 (3), 195-213, 2005
562005
Periodicity on partial words
F Blanchet-Sadri
Computers & Mathematics with Applications 47 (1), 71-82, 2004
512004
Codes, orderings, and partial words
F Blanchet-Sadri
Theoretical Computer Science 329 (1-3), 177-202, 2004
422004
Conjugacy on partial words
F Blanchet-Sadri, DK Luhmann
Theoretical Computer Science 289 (1), 297-312, 2002
352002
Partial words and the critical factorization theorem
F Blanchet-Sadri, S Duncan
Journal of Combinatorial Theory, Series A 109 (2), 221-245, 2005
332005
Local periods and binary partial words: an algorithm
F Blanchet-Sadri, A Chriscoe
Theoretical Computer Science 314 (1-2), 189-216, 2004
332004
Games, equations and the dot-depth hierarchy
F Blanchet-Sadri
Computers & Mathematics with Applications 18 (9), 809-822, 1989
321989
Equations and monoid varieties of dot-depth one and two
F Blanchet-Sadri
Theoretical computer science 123 (2), 239-258, 1994
291994
A generalization of Thue freeness for partial words
F Blanchet-Sadri, R Mercaş, G Scott
Theoretical Computer Science 410 (8-10), 793-800, 2009
272009
Counting distinct squares in partial words
F Blanchet-Sadri, R Mercaş, G Scott
Acta Cybernetica 19 (2), 465-477, 2009
232009
Some logical characterizations of the dot-depth hierarchy and applications
F Blanchet-Sadri
Journal of Computer and System Sciences 51 (2), 324, 1995
23*1995
Strict bounds for pattern avoidance
F Blanchet-Sadri, B Woodhouse
Theoretical Computer Science 506, 17-28, 2013
222013
Unavoidable sets of partial words
F Blanchet-Sadri, NC Brownstein, A Kalcic, J Palumbo, T Weyand
Theory of Computing Systems 45 (2), 381-406, 2009
202009
Testing primitivity on partial words
F Blanchet-Sadri, AR Anavekar
Discrete Applied Mathematics 155 (3), 279-287, 2007
192007
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
182008
Equations and dot-depth one
F Blanchet-Sadri
Semigroup Forum 47 (1), 305-317, 1993
181993
Games, equations and dot-depth two monoids
F Blanchet-Sadri
Discrete applied mathematics 39 (2), 99-111, 1992
161992
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20