Francine Blanchet-Sadri

Eur. J. Comb., 2018

Border correlations, lattices, and the subgraph component polynomial.

[BibT_eX]

[DOI]

Michelle Cordier

Rachel Kirsch

Eur. J. Comb., 2018

Computing longest common extensions in partial words.

[BibT_eX]

[DOI]

S. Osborne

Discret. Appl. Math., 2018

2017

Computing generalized de Bruijn sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.

[BibT_eX]

[DOI]

Michelle Bodnar

Benjamin De Winkle

Theory Comput. Syst., 2017

Pattern Avoidance in Partial Words Dense with Holes.

[BibT_eX]

[DOI]

Kevin Black

Ian Coley

Brent Woodhouse

Andrew Zemke

J. Autom. Lang. Comb., 2017

Minimal partial languages and automata.

[BibT_eX]

[DOI]

Kira Goldner

Aidan Shackleton

RAIRO Theor. Informatics Appl., 2017

Constructing Words with High Distinct Square Densities.

[BibT_eX]

[DOI]

S. Osborne

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Dyck Words, Lattice Paths, and Abelian Borders.

[BibT_eX]

[DOI]

Kun Chen

Kenneth Hawes

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Unavoidable Sets of Partial Words of Uniform Length.

[BibT_eX]

[DOI]

Joey Becker

Laure Flapan

Stephen Watkins

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2016

Computing abelian complexity of binary uniform morphic words.

[BibT_eX]

[DOI]

Daniel Seita

David Wise

Theor. Comput. Sci., 2016

Combinatorics on partial word borders.

[BibT_eX]

[DOI]

Emily Allen

Theor. Comput. Sci., 2016

Recurrent Partial Words and Representable Sets.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

Computing Depths of Patterns.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

2015

Computing minimum length representations of sets of words of uniform length.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the state complexity of partial word DFAs.

[BibT_eX]

[DOI]

Eric Balkanski

Matthew Kilgore

Benjamin J. Wyatt

Theor. Comput. Sci., 2015

Squares and primitivity in partial words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Longest Common Extensions in Partial Words.

[BibT_eX]

[DOI]

Rachel Harred

Justin Lazarow

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Squareable Words.

[BibT_eX]

[DOI]

Abraham Rashin

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

2014

Squares in partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Recurrence in infinite partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Abelian pattern avoidance in partial words.

[BibT_eX]

[DOI]

Benjamin De Winkle

RAIRO Theor. Informatics Appl., 2014

Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.

[BibT_eX]

[DOI]

James D. Currie

Narad Rampersad

Integers, 2014

On the asymptotic abelian complexity of morphic words.

[BibT_eX]

[DOI]

Narad Rampersad

Adv. Appl. Math., 2014

Computing Depths of Patterns.

[BibT_eX]

[DOI]

Brent Woodhouse

Proceedings of the Language and Automata Theory and Applications, 2014

Computing Primitively-Rooted Squares and Runs in Partial Words.

[BibT_eX]

[DOI]

Jordan Nikkel

J. D. Quigley

Xufan Zhang

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Strict bounds for pattern avoidance.

[BibT_eX]

[DOI]

Brent Woodhouse

Theor. Comput. Sci., 2013

Deciding representability of sets of words of equal length.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Abelian-primitive partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Computing the partial word avoidability indices of ternary patterns.

[BibT_eX]

[DOI]

Shane Scott

J. Discrete Algorithms, 2013

Computing the partial word avoidability indices of binary patterns.

[BibT_eX]

[DOI]

Shane Scott

J. Discrete Algorithms, 2013

Abelian periods, partial words, and an extension of a theorem of Fine and Wilf.

[BibT_eX]

[DOI]

Amelia Tebbe

Amy Veprauskas

RAIRO Theor. Informatics Appl., 2013

A note on constructing infinite binary words with polynomial subword complexity.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2013

Counting minimal semi-Sturmian words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Partial Word DFAs.

[BibT_eX]

[DOI]

Eric Balkanski

Matthew Kilgore

Benjamin J. Wyatt

Proceedings of the Implementation and Application of Automata, 2013

Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.

[BibT_eX]

[DOI]

Justin Lazarow

Proceedings of the Language and Automata Theory and Applications, 2013

A Graph Polynomial Approach to Primitivity.

[BibT_eX]

[DOI]

Michelle Bodnar

Joe Hidakatsu

Proceedings of the Language and Automata Theory and Applications, 2013

Deciding Representability of Sets of Words of Equal Length in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

On the Asymptotic Abelian Complexity of Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Periodicity algorithms and a conjecture on overlaps in partial words.

[BibT_eX]

[DOI]

Abraham Rashin

Elara Willett

Theor. Comput. Sci., 2012

The three-squares lemma for partial words with one hole.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Constructing partial words with subword complexities not achievable by full words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Periods in partial words: An algorithm.

[BibT_eX]

[DOI]

Travis Mandel

Gautam Sisodia

J. Discrete Algorithms, 2012

Number of holes in unavoidable sets of partial words II.

[BibT_eX]

[DOI]

Steven Ji

Elizabeth Reiland

J. Discrete Algorithms, 2012

Number of holes in unavoidable sets of partial words I.

[BibT_eX]

[DOI]

Aleksandar Chakarov

J. Discrete Algorithms, 2012

Avoiding abelian squares in partial words.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Algorithmic Combinatorics on Partial Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Erratum to: Avoidable binary patterns in partial words.

[BibT_eX]

[DOI]

Eric Weissenstein

Acta Informatica, 2012

Abelian repetitions in partial words.

[BibT_eX]

[DOI]

Dimin Xu

Adv. Appl. Math., 2012

Abelian Pattern Avoidance in Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Squares in Binary Partial Words.

[BibT_eX]

[DOI]

Yang Jiao

John M. Machacek

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Avoiding large squares in partial words.

[BibT_eX]

[DOI]

Ilkyoo Choi

Theor. Comput. Sci., 2011

On minimal Sturmian partial words.

[BibT_eX]

[DOI]

John Lensmire

Discret. Appl. Math., 2011

Recurrent Partial Words

[BibT_eX]

[DOI]

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

Counting Bordered Partial Words by Critical Positions.

[BibT_eX]

[DOI]

Emily Allen

Cameron Byrum

Mihai Cucuringu

Electron. J. Comb., 2011

Avoidable binary patterns in partial words.

[BibT_eX]

[DOI]

Eric Weissenstein

Acta Informatica, 2011

Unary Pattern Avoidance in Partial Words Dense with Holes.

[BibT_eX]

[DOI]

Kevin Black

Andrew Zemke

Proceedings of the Language and Automata Theory and Applications, 2011

Avoiding Abelian Powers in Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

On Operations Preserving Primitivity of Partial Words with One Hole.

[BibT_eX]

Sarah Nelson

Amelia Tebbe

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

Open Problems on Avoidable Patterns in Partial Words.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010

On the complexity of deciding avoidability of sets of partial words.

[BibT_eX]

[DOI]

Brandon Blakeley

Josh Gunter

Narad Rampersad

Theor. Comput. Sci., 2010

Border Correlations of Partial Words.

[BibT_eX]

[DOI]

E. Clader

O. Simpson

Theory Comput. Syst., 2010

Combinatorics on partial word correlations.

[BibT_eX]

[DOI]

Justin Fowler

Joshua D. Gafni

Kevin H. Wilson

J. Comb. Theory, Ser. A, 2010

Counting Primitive Partial Words.

[BibT_eX]

[DOI]

Mihai Cucuringu

J. Autom. Lang. Comb., 2010

Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods.

[BibT_eX]

[DOI]

Taktin Oey

Timothy D. Rankin

Int. J. Found. Comput. Sci., 2010

Binary De Bruijn Partial Words with One Hole.

[BibT_eX]

[DOI]

Jarett Schwartz

Slater Stich

Benjamin J. Wyatt

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Abelian Square-Free Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.

[BibT_eX]

[DOI]

Aleksandar Chakarov

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Classifying All Avoidable Sets of Partial Words of Size Two.

[BibT_eX]

Proceedings of the Scientific Applications of Language Methods., 2010

2009

A generalization of Thue freeness for partial words.

[BibT_eX]

[DOI]

Geoffrey Scott

Theor. Comput. Sci., 2009

Testing avoidability on sets of partial words is hard.

[BibT_eX]

[DOI]

Raphaël M. Jungers

Justin Palumbo

Theor. Comput. Sci., 2009

Unavoidable Sets of Partial Words.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Equations on partial words.

[BibT_eX]

[DOI]

D. Dakota Blair

Rebeca V. Lewis

RAIRO Theor. Informatics Appl., 2009

Unbordered partial words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Counting Distinct Squares in Partial Words.

[BibT_eX]

[DOI]

Geoffrey Scott

Acta Cybern., 2009

An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.

[BibT_eX]

[DOI]

Abraham Rashin

Elara Willett

Proceedings of the Language and Automata Theory and Applications, 2009

How Many Holes Can an Unbordered Partial Word Contain?.

[BibT_eX]

[DOI]

Emily Allen

Cameron Byrum

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Open Problems on Partial Words.

[BibT_eX]

[DOI]

Proceedings of the New Developments in Formal Languages and Applications, 2008

Remarks on Two Nonstandard Versions of Periodicity in Words.

[BibT_eX]

[DOI]

L. Bromberg

K. Zipple

Int. J. Found. Comput. Sci., 2008

Periodicity properties on partial words.

[BibT_eX]

[DOI]

Kevin Corcoran

Jenell Nyberg

Inf. Comput., 2008

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

[BibT_eX]

[DOI]

Deepak Bal

Gautam Sisodia

Inf. Comput., 2008

Computing Weak Periods of Partial Words.

[BibT_eX]

Taktin Oey

Timothy D. Rankin

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

Algorithmic Combinatorics on Partial Words.

[BibT_eX]

[DOI]

Discrete mathematics and its applications, CRC Press, ISBN: 978-1-4200-6092-8, 2008

2007

Partial words and the critical factorization theorem revisited.

[BibT_eX]

[DOI]

Nathan D. Wetzler

Theor. Comput. Sci., 2007

Testing primitivity on partial words.

[BibT_eX]

[DOI]

Arundhati R. Anavekar

Discret. Appl. Math., 2007

Correlations of Partial Words.

[BibT_eX]

[DOI]

Joshua D. Gafni

Kevin H. Wilson

Proceedings of the STACS 2007, 2007

Fine and Wilf's Periodicity Result on Partial Words and Consequences.

[BibT_eX]

Kevin Corcoran

Jenell Nyberg

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.

[BibT_eX]

[DOI]

N. C. Brownstein

Justin Palumbo

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2005

Partial words and the critical factorization theorem.

[BibT_eX]

[DOI]

S. Duncan

J. Comb. Theory, Ser. A, 2005

Algorithms for approximate k-covering of strings.

[BibT_eX]

[DOI]

Lili Zhang

Int. J. Found. Comput. Sci., 2005

Primitive partial words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Local periods and binary partial words: an algorithm.

[BibT_eX]

[DOI]

Ajay Chriscoe

Theor. Comput. Sci., 2004

Codes, orderings, and partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2002

Conjugacy on partial words.

[BibT_eX]

[DOI]

D. K. Luhmann

Theor. Comput. Sci., 2002

Partial words and a theorem of Fine and Wilf revisited.

[BibT_eX]

[DOI]

Robert A. Hegstrom

Theor. Comput. Sci., 2002

2001

On unique, multiset, set decipherability of three-word codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

1998

Trees, Congruences and Varieties of Finite Semigroups.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1997

1996

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1996

Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

Some Logical Characterizations of the Dot-Depth Hierarchy and Applications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height <i>k</i>.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

1994

Equations and Monoid Varieties of Dot-Depth One and Two.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

On a complete set of generators for dot-depth two.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1992

The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Games, Equations and Dot-Depth Two Monoids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1990

On dot-depth two.

[BibT_eX]

[DOI]