Francine Blanchet-Sadri

According to our database1, Francine Blanchet-Sadri
  • authored at least 112 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.
Theory Comput. Syst., 2017

Constructing Words with High Distinct Square Densities.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Dyck Words, Lattice Paths, and Abelian Borders.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Unavoidable Sets of Partial Words of Uniform Length.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2016
Computing abelian complexity of binary uniform morphic words.
Theor. Comput. Sci., 2016

Combinatorics on partial word borders.
Theor. Comput. Sci., 2016

Recurrent Partial Words and Representable Sets.
Journal of Automata, Languages and Combinatorics, 2016

Computing Depths of Patterns.
RAIRO - Theor. Inf. and Applic., 2016

2015
Computing minimum length representations of sets of words of uniform length.
Theor. Comput. Sci., 2015

On the state complexity of partial word DFAs.
Theor. Comput. Sci., 2015

Squares and primitivity in partial words.
Discrete Applied Mathematics, 2015

Longest Common Extensions in Partial Words.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Squareable Words.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Squares in partial words.
Theor. Comput. Sci., 2014

Recurrence in infinite partial words.
Theor. Comput. Sci., 2014

Abelian pattern avoidance in partial words.
RAIRO - Theor. Inf. and Applic., 2014

Minimal Partial Languages and Automata.
Proceedings of the Implementation and Application of Automata, 2014

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Computing Depths of Patterns.
Proceedings of the Language and Automata Theory and Applications, 2014

Computing Primitively-Rooted Squares and Runs in Partial Words.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Computing Minimum Length Representations of Sets of Words of Uniform Length.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Border Correlations, Lattices, and the Subgraph Component Polynomial.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
Strict bounds for pattern avoidance.
Theor. Comput. Sci., 2013

Deciding representability of sets of words of equal length.
Theor. Comput. Sci., 2013

Abelian-primitive partial words.
Theor. Comput. Sci., 2013

Computing the partial word avoidability indices of ternary patterns.
J. Discrete Algorithms, 2013

Computing the partial word avoidability indices of binary patterns.
J. Discrete Algorithms, 2013

Abelian periods, partial words, and an extension of a theorem of Fine and Wilf.
RAIRO - Theor. Inf. and Applic., 2013

A note on constructing infinite binary words with polynomial subword complexity.
RAIRO - Theor. Inf. and Applic., 2013

Counting minimal semi-Sturmian words.
Discrete Applied Mathematics, 2013

Partial Word DFAs.
Proceedings of the Implementation and Application of Automata, 2013

Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.
Proceedings of the Language and Automata Theory and Applications, 2013

A Graph Polynomial Approach to Primitivity.
Proceedings of the Language and Automata Theory and Applications, 2013

Deciding Representability of Sets of Words of Equal Length in Polynomial Time.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Strict Bounds for Pattern Avoidance.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

On the Asymptotic Abelian Complexity of Morphic Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Periodicity algorithms and a conjecture on overlaps in partial words.
Theor. Comput. Sci., 2012

The three-squares lemma for partial words with one hole.
Theor. Comput. Sci., 2012

Constructing partial words with subword complexities not achievable by full words.
Theor. Comput. Sci., 2012

Periods in partial words: An algorithm.
J. Discrete Algorithms, 2012

Number of holes in unavoidable sets of partial words II.
J. Discrete Algorithms, 2012

Number of holes in unavoidable sets of partial words I.
J. Discrete Algorithms, 2012

Avoiding abelian squares in partial words.
J. Comb. Theory, Ser. A, 2012

Algorithmic Combinatorics on Partial Words.
Int. J. Found. Comput. Sci., 2012

Erratum to: Avoidable binary patterns in partial words.
Acta Inf., 2012

Abelian Pattern Avoidance in Partial Words.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Computing the Partial Word Avoidability Indices of Ternary Patterns.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Squares in Binary Partial Words.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Deciding Representability of Sets of Words of Equal Length.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011
Avoiding large squares in partial words.
Theor. Comput. Sci., 2011

On minimal Sturmian partial words.
Discrete Applied Mathematics, 2011

Recurrent Partial Words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Counting Bordered Partial Words by Critical Positions.
Electr. J. Comb., 2011

Avoidable binary patterns in partial words.
Acta Inf., 2011

On Minimal Sturmian Partial Words.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Unary Pattern Avoidance in Partial Words Dense with Holes.
Proceedings of the Language and Automata Theory and Applications, 2011

Periods in Partial Words: An Algorithm.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Avoiding Abelian Powers in Partial Words.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

On Operations Preserving Primitivity of Partial Words with One Hole.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

Open Problems on Avoidable Patterns in Partial Words.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
On the complexity of deciding avoidability of sets of partial words.
Theor. Comput. Sci., 2010

Border Correlations of Partial Words.
Theory Comput. Syst., 2010

Combinatorics on partial word correlations.
J. Comb. Theory, Ser. A, 2010

Counting Primitive Partial Words.
Journal of Automata, Languages and Combinatorics, 2010

Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods.
Int. J. Found. Comput. Sci., 2010

Binary De Bruijn Partial Words with One Hole.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Avoidable Binary Patterns in Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

Abelian Square-Free Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Classifying All Avoidable Sets of Partial Words of Size Two.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
A generalization of Thue freeness for partial words.
Theor. Comput. Sci., 2009

Testing avoidability on sets of partial words is hard.
Theor. Comput. Sci., 2009

Unavoidable Sets of Partial Words.
Theory Comput. Syst., 2009

A note on the number of squares in a partial word with one hole.
ITA, 2009

Equations on partial words.
ITA, 2009

Unbordered partial words.
Discrete Applied Mathematics, 2009

Counting Distinct Squares in Partial Words.
Acta Cybern., 2009

An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.
Proceedings of the Language and Automata Theory and Applications, 2009

How Many Holes Can an Unbordered Partial Word Contain?.
Proceedings of the Language and Automata Theory and Applications, 2009

On the Complexity of Deciding Avoidability of Sets of Partial Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Open Problems on Partial Words.
Proceedings of the New Developments in Formal Languages and Applications, 2008

Remarks on Two Nonstandard Versions of Periodicity in Words.
Int. J. Found. Comput. Sci., 2008

Periodicity properties on partial words.
Inf. Comput., 2008

Graph connectivity, partial words, and a theorem of Fine and Wilf.
Inf. Comput., 2008

Computing Weak Periods of Partial Words.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

Counting Distinct Squares in Partial Words.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

Algorithmic Combinatorics on Partial Words.
Discrete mathematics and its applications, CRC Press, ISBN: 978-1-4200-6092-8, 2008

2007
Partial words and the critical factorization theorem revisited.
Theor. Comput. Sci., 2007

Testing primitivity on partial words.
Discrete Applied Mathematics, 2007

Correlations of Partial Words.
Proceedings of the STACS 2007, 2007

Fine and Wilf's Periodicity Result on Partial Words and Consequences.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Two Element Unavoidable Sets of Partial Words.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Equations on Partial Words.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
Partial words and the critical factorization theorem.
J. Comb. Theory, Ser. A, 2005

Algorithms for approximate k-covering of strings.
Int. J. Found. Comput. Sci., 2005

Primitive partial words.
Discrete Applied Mathematics, 2005

2004
Local periods and binary partial words: an algorithm.
Theor. Comput. Sci., 2004

Codes, orderings, and partial words.
Theor. Comput. Sci., 2004

2002
Conjugacy on partial words.
Theor. Comput. Sci., 2002

Partial words and a theorem of Fine and Wilf revisited.
Theor. Comput. Sci., 2002

2001
On unique, multiset, set decipherability of three-word codes.
IEEE Trans. Information Theory, 2001

1998
Trees, Congruences and Varieties of Finite Semigroups.
Discrete Applied Mathematics, 1998

1997
On the Semidirect Product of the Pseudovariety of Semilattices by a Locally Finite Pseudovariety of Groups.
ITA, 1997

1996
On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids.
ITA, 1996

Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy.
Discrete Applied Mathematics, 1996

1995
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications.
J. Comput. Syst. Sci., 1995

Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k.
ITA, 1995

1994
Equations and Monoid Varieties of Dot-Depth One and Two.
Theor. Comput. Sci., 1994

On a complete set of generators for dot-depth two.
Discrete Applied Mathematics, 1994

1992
The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable.
Int. J. Found. Comput. Sci., 1992

Games, Equations and Dot-Depth Two Monoids.
Discrete Applied Mathematics, 1992

1990
On dot-depth two.
ITA, 1990


  Loading...