Francine Blanchet-Sadri

122 papers A 3B 2C 27Journal 78Unranked 9

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Dyck Words, Lattice Paths, and Abelian Borders. Int. J. Found. Comput. Sci. Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes
2018	J	`jnl`	Border correlations, lattices, and the subgraph component polynomial. Eur. J. Comb. Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch
2018	J	`jnl`	Computing longest common extensions in partial words. Discret. Appl. Math. Francine Blanchet-Sadri, S. Osborne
2018	J	`jnl`	Computing primitively-rooted squares and runs in partial words. Eur. J. Comb. Francine Blanchet-Sadri, Justin Lazarow, Jordan Nikkel, J. D. Quigley, Xufan Zhang
2017	J	`jnl`	Computing generalized de Bruijn sequences. Theor. Comput. Sci. Francine Blanchet-Sadri, Sinziana Munteanu
2017	—	`conf`	Constructing Words with High Distinct Square Densities. AFL Francine Blanchet-Sadri, S. Osborne
2017	—	`conf`	Dyck Words, Lattice Paths, and Abelian Borders. AFL Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes
2017	J	`jnl`	Minimal partial languages and automata. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton
2017	J	`jnl`	New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. Theory Comput. Syst. Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
2017	J	`jnl`	Pattern Avoidance in Partial Words Dense with Holes. J. Autom. Lang. Comb. Kevin Black, Francine Blanchet-Sadri, Ian Coley, Brent Woodhouse, Andrew Zemke
2017	—	`conf`	Unavoidable Sets of Partial Words of Uniform Length. AFL Joey Becker, Francine Blanchet-Sadri, Laure Flapan, Stephen Watkins
2016	J	`jnl`	Combinatorics on partial word borders. Theor. Comput. Sci. Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire
2016	J	`jnl`	Computing Depths of Patterns. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Andrew Lohr
2016	J	`jnl`	Computing abelian complexity of binary uniform morphic words. Theor. Comput. Sci. Francine Blanchet-Sadri, Daniel Seita, David Wise
2016	J	`jnl`	Recurrent Partial Words and Representable Sets. J. Autom. Lang. Comb. Francine Blanchet-Sadri, Aleksandar Chakarov, Bob Chen, Lucas Manuelli, Sinziana Munteanu, Jarett Schwartz, Slater Stich
2015	J	`jnl`	Computing minimum length representations of sets of words of uniform length. Theor. Comput. Sci. Francine Blanchet-Sadri, Andrew Lohr
2015	C	`conf`	Longest Common Extensions in Partial Words. IWOCA Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow
2015	J	`jnl`	On the state complexity of partial word DFAs. Theor. Comput. Sci. Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt
2015	C	`conf`	Squareable Words. DLT Francine Blanchet-Sadri, Abraham Rashin
2015	J	`jnl`	Squares and primitivity in partial words. Discret. Appl. Math. Francine Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley, Xufan Zhang
2014	J	`jnl`	Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
2014	J	`jnl`	Abelian pattern avoidance in partial words. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Benjamin De Winkle, Sean Simmons
2014	C	`conf`	Border Correlations, Lattices, and the Subgraph Component Polynomial. IWOCA Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch
2014	C	`conf`	Computing Depths of Patterns. LATA Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse
2014	C	`conf`	Computing Minimum Length Representations of Sets of Words of Uniform Length. IWOCA Francine Blanchet-Sadri, Andrew Lohr
2014	C	`conf`	Computing Primitively-Rooted Squares and Runs in Partial Words. IWOCA Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang
2014	C	`conf`	Minimal Partial Languages and Automata. CIAA Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton
2014	A	`conf`	New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. STACS Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
2014	J	`jnl`	On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. Francine Blanchet-Sadri, Nathan Fox, Narad Rampersad
2014	J	`jnl`	Recurrence in infinite partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu
2014	J	`jnl`	Squares in partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Yang Jiao, John M. Machacek, J. D. Quigley, Xufan Zhang
2013	C	`conf`	A Graph Polynomial Approach to Primitivity. LATA Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu
2013	J	`jnl`	A note on constructing infinite binary words with polynomial subword complexity. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu
2013	J	`jnl`	Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Sean Simmons, Amelia Tebbe, Amy Veprauskas
2013	J	`jnl`	Abelian-primitive partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Nathan Fox
2013	J	`jnl`	Computing the partial word avoidability indices of binary patterns. J. Discrete Algorithms Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
2013	J	`jnl`	Computing the partial word avoidability indices of ternary patterns. J. Discrete Algorithms Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
2013	J	`jnl`	Counting minimal semi-Sturmian words. Discret. Appl. Math. Francine Blanchet-Sadri, Sean Simmons
2013	C	`conf`	Deciding Representability of Sets of Words of Equal Length in Polynomial Time. IWOCA Francine Blanchet-Sadri, Sinziana Munteanu
2013	J	`jnl`	Deciding representability of sets of words of equal length. Theor. Comput. Sci. Francine Blanchet-Sadri, Sean Simmons
2013	C	`conf`	On the Asymptotic Abelian Complexity of Morphic Words. Developments in Language Theory Francine Blanchet-Sadri, Nathan Fox
2013	C	`conf`	Partial Word DFAs. CIAA Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt
2013	C	`conf`	Strict Bounds for Pattern Avoidance. Developments in Language Theory Francine Blanchet-Sadri, Brent Woodhouse
2013	J	`jnl`	Strict bounds for pattern avoidance. Theor. Comput. Sci. Francine Blanchet-Sadri, Brent Woodhouse
2013	C	`conf`	Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. LATA Francine Blanchet-Sadri, Justin Lazarow
2012	B	`conf`	Abelian Pattern Avoidance in Partial Words. MFCS Francine Blanchet-Sadri, Sean Simmons
2012	J	`jnl`	Abelian repetitions in partial words. Adv. Appl. Math. Francine Blanchet-Sadri, Sean Simmons, Dimin Xu
2012	J	`jnl`	Algorithmic Combinatorics on Partial Words. Int. J. Found. Comput. Sci. Francine Blanchet-Sadri
2012	J	`jnl`	Avoiding abelian squares in partial words. J. Comb. Theory A Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons, Dimin Xu
2012	C	`conf`	Computing the Partial Word Avoidability Indices of Ternary Patterns. IWOCA Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
2012	J	`jnl`	Constructing partial words with subword complexities not achievable by full words. Theor. Comput. Sci. Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich
2012	—	`conf`	Deciding Representability of Sets of Words of Equal Length. DCFS Francine Blanchet-Sadri, Sean Simmons
2012	J	`jnl`	Erratum to: Avoidable binary patterns in partial words. Acta Informatica Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
2012	J	`jnl`	Number of holes in unavoidable sets of partial words I. J. Discrete Algorithms Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
2012	J	`jnl`	Number of holes in unavoidable sets of partial words II. J. Discrete Algorithms Francine Blanchet-Sadri, Steven Ji, Elizabeth Reiland
2012	J	`jnl`	Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
2012	J	`jnl`	Periods in partial words: An algorithm. J. Discrete Algorithms Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
2012	C	`conf`	Squares in Binary Partial Words. Developments in Language Theory Francine Blanchet-Sadri, Yang Jiao, John M. Machacek
2012	J	`jnl`	The three-squares lemma for partial words with one hole. Theor. Comput. Sci. Francine Blanchet-Sadri, Robert Mercas
2011	J	`jnl`	Avoidable binary patterns in partial words. Acta Informatica Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
2011	C	`conf`	Avoiding Abelian Powers in Partial Words. Developments in Language Theory Francine Blanchet-Sadri, Sean Simmons
2011	J	`jnl`	Avoiding large squares in partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas
2011	J	`jnl`	Counting Bordered Partial Words by Critical Positions. Electron. J. Comb. Emily Allen, Francine Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu, Robert Mercas
2011	A	`conf`	On Minimal Sturmian Partial Words. STACS Francine Blanchet-Sadri, John Lensmire
2011	—	`conf`	On Operations Preserving Primitivity of Partial Words with One Hole. AFL Francine Blanchet-Sadri, Sarah Nelson, Amelia Tebbe
2011	J	`jnl`	On minimal Sturmian partial words. Discret. Appl. Math. Francine Blanchet-Sadri, John Lensmire
2011	—	`conf`	Open Problems on Avoidable Patterns in Partial Words. AFL Francine Blanchet-Sadri
2011	C	`conf`	Periods in Partial Words: An Algorithm. IWOCA Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
2011	—	`conf`	Recurrent Partial Words WORDS Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich
2011	C	`conf`	Unary Pattern Avoidance in Partial Words Dense with Holes. LATA Francine Blanchet-Sadri, Kevin Black, Andrew Zemke
2010	C	`conf`	Abelian Square-Free Partial Words. LATA Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons
2010	C	`conf`	Avoidable Binary Patterns in Partial Words. LATA Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
2010	C	`conf`	Binary De Bruijn Partial Words with One Hole. TAMC Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt
2010	J	`jnl`	Border Correlations of Partial Words. Theory Comput. Syst. Francine Blanchet-Sadri, E. Clader, O. Simpson
2010	—	`ch.`	Classifying All Avoidable Sets of Partial Words of Size Two. Scientific Applications of Language Methods Francine Blanchet-Sadri, Brandon Blakeley, Josh Gunter, Sean Simmons, Eric Weissenstein
2010	J	`jnl`	Combinatorics on partial word correlations. J. Comb. Theory A Francine Blanchet-Sadri, Justin Fowler, Joshua D. Gafni, Kevin H. Wilson
2010	J	`jnl`	Counting Primitive Partial Words. J. Autom. Lang. Comb. Francine Blanchet-Sadri, Mihai Cucuringu
2010	J	`jnl`	Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods. Int. J. Found. Comput. Sci. Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin
2010	C	`conf`	Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. IWOCA Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
2010	J	`jnl`	On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
2009	J	`jnl`	A generalization of Thue freeness for partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
2009	J	`jnl`	A note on the number of squares in a partial word with one hole. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, Robert Mercas
2009	C	`conf`	An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. LATA Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
2009	J	`jnl`	Counting Distinct Squares in Partial Words. Acta Cybern. Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
2009	J	`jnl`	Equations on partial words. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
2009	C	`conf`	How Many Holes Can an Unbordered Partial Word Contain?. LATA Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas
2009	C	`conf`	On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
2009	J	`jnl`	Testing avoidability on sets of partial words is hard. Theor. Comput. Sci. Francine Blanchet-Sadri, Raphaël M. Jungers, Justin Palumbo
2009	J	`jnl`	Unavoidable Sets of Partial Words. Theory Comput. Syst. Francine Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo, Tracy Weyand
2009	J	`jnl`	Unbordered partial words. Discret. Appl. Math. Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield
2008	—	`book`	Algorithmic Combinatorics on Partial Words. Francine Blanchet-Sadri
2008	—	`conf`	Computing Weak Periods of Partial Words. AFL Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin
2008	—	`conf`	Counting Distinct Squares in Partial Words. AFL Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
2008	J	`jnl`	Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia
2008	—	`ch.`	Open Problems on Partial Words. New Developments in Formal Languages and Applications Francine Blanchet-Sadri
2008	J	`jnl`	Periodicity properties on partial words. Inf. Comput. Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
2008	J	`jnl`	Remarks on Two Nonstandard Versions of Periodicity in Words. Int. J. Found. Comput. Sci. Francine Blanchet-Sadri, L. Bromberg, K. Zipple
2007	A	`conf`	Correlations of Partial Words. STACS Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
2007	C	`conf`	Fine and Wilf's Periodicity Result on Partial Words and Consequences. LATA Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
2007	J	`jnl`	Partial words and the critical factorization theorem revisited. Theor. Comput. Sci. Francine Blanchet-Sadri, Nathan D. Wetzler
2007	J	`jnl`	Testing primitivity on partial words. Discret. Appl. Math. Francine Blanchet-Sadri, Arundhati R. Anavekar
2007	C	`conf`	Two Element Unavoidable Sets of Partial Words. Developments in Language Theory Francine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo
2006	B	`conf`	Equations on Partial Words. MFCS Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
2005	J	`jnl`	Algorithms for approximate k-covering of strings. Int. J. Found. Comput. Sci. Lili Zhang, Francine Blanchet-Sadri
2005	J	`jnl`	Partial words and the critical factorization theorem. J. Comb. Theory A Francine Blanchet-Sadri, S. Duncan
2005	J	`jnl`	Primitive partial words. Discret. Appl. Math. Francine Blanchet-Sadri
2004	J	`jnl`	Codes, orderings, and partial words. Theor. Comput. Sci. Francine Blanchet-Sadri
2004	J	`jnl`	Local periods and binary partial words: an algorithm. Theor. Comput. Sci. Francine Blanchet-Sadri, Ajay Chriscoe
2002	J	`jnl`	Conjugacy on partial words. Theor. Comput. Sci. Francine Blanchet-Sadri, D. K. Luhmann
2002	J	`jnl`	Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci. Francine Blanchet-Sadri, Robert A. Hegstrom
2001	J	`jnl`	On unique, multiset, set decipherability of three-word codes. IEEE Trans. Inf. Theory Francine Blanchet-Sadri
1998	J	`jnl`	Trees, Congruences and Varieties of Finite Semigroups. Discret. Appl. Math. Francine Blanchet-Sadri
1997	J	`jnl`	On the Semidirect Product of the Pseudovariety of Semilattices by a Locally Finite Pseudovariety of Groups. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri
1996	J	`jnl`	Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy. Discret. Appl. Math. Francine Blanchet-Sadri
1996	J	`jnl`	On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri
1995	J	`jnl`	Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri
1995	J	`jnl`	Some Logical Characterizations of the Dot-Depth Hierarchy and Applications. J. Comput. Syst. Sci. Francine Blanchet-Sadri
1994	J	`jnl`	Equations and Monoid Varieties of Dot-Depth One and Two. Theor. Comput. Sci. Francine Blanchet-Sadri
1994	J	`jnl`	On a complete set of generators for dot-depth two. Discret. Appl. Math. Francine Blanchet-Sadri
1992	J	`jnl`	Games, Equations and Dot-Depth Two Monoids. Discret. Appl. Math. Francine Blanchet-Sadri
1992	J	`jnl`	The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable. Int. J. Found. Comput. Sci. Francine Blanchet-Sadri
1990	J	`jnl`	On dot-depth two. RAIRO Theor. Informatics Appl. Francine Blanchet-Sadri