James D. Currie

发表

Binary Words Containing Infinitely Many Overlaps

Jeffrey Shallit, James D. Currie, Narad Rampersad, 2006, Electron. J. Comb..

Cantor Sets and Dejean's Conjecture

James D. Currie, Robert O. Shelton, J. Currie, 1996, Developments in Language Theory.

Avoiding Three Consecutive Blocks of the Same Size and Same Sum

Jeffrey Shallit, James D. Currie, Julien Cassaigne, 2011, J. ACM.

Connectivity of distance graphs

James D. Currie, 1992, Discret. Math..

Words Strongly Avoiding Fractional Powers

James D. Currie, Julien Cassaigne, J. Cassaigne, 1999, Eur. J. Comb..

Circular Words Avoiding Patterns

James D. Currie, D. Sean Fitzpatrick, 2002, Developments in Language Theory.

Unary Patterns with Permutations

James D. Currie, Florin Manea, Dirk Nowotka, 2015, DLT.

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract)

James D. Currie, Narad Rampersad, Kalle Saari, 2013, WORDS.

Binary words avoiding xx^Rx and strongly unimodal sequences

James D. Currie, Narad Rampersad, 2015, J. Integer Seq..

Square-free Words with Square-free Self-shuffles

James D. Currie, Kalle Saari, 2014, Electron. J. Comb..

Extremal Words in the Shift Orbit Closure of a Morphic Sequence

James D. Currie, Narad Rampersad, Kalle Saari, 2013, Developments in Language Theory.

There Exist Binary Circular 5/2+ Power Free Words of Every Length

James D. Currie, Ali Aberkane, 2004, Electron. J. Comb..

A cyclic binary morphism avoiding Abelian fourth powers

James D. Currie, Ali Aberkane, 2009, Theor. Comput. Sci..

The Fixing Block Method in Combinatorics on Words

James D. Currie, Cameron W. Pierce, 2003, Comb..

Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words

James D. Currie, 2019, J. Integer Seq..

The number of binary words avoiding abelian fourth powers grows exponentially

James D. Currie, J. Currie, 2004, Theor. Comput. Sci..

On Abelian 2-avoidable binary patterns

James D. Currie, Terry I. Visentin, T. Visentin, 2007, Acta Informatica.

The lexicographically least word in the orbit closure of the Rudin-Shapiro word pdf

James D. Currie, 2009, ArXiv.

On the structure and extendibility of k-power free words

James D. Currie, 1995, Eur. J. Comb..

Some further results on squarefree arithmetic progressions in infinite words pdf

Tero Harju, James D. Currie, Narad Rampersad, 2019, Theor. Comput. Sci..

The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27

James D. Currie, Narad Rampersad, Lucas Mol, 2020, J. Integer Seq..

Extremal words in morphic subshifts

James D. Currie, Narad Rampersad, Luca Q. Zamboni, 2014, Discret. Math..

On avoidability of formulas with reversal

James D. Currie, Narad Rampersad, Lucas Mol, 2017, RAIRO Theor. Informatics Appl..

Non-repetitive words: Ages and essences

James D. Currie, 1996, Comb..

The undirected repetition threshold and undirected pattern avoidance pdf

James D. Currie, Lucas Mol, 2020, ArXiv.

Least Periods of Factors of Infinite Words

James D. Currie, Kalle Saari, J. Currie, 2009, RAIRO Theor. Informatics Appl..

Separating Words with Small Grammars

Jeffrey Shallit, James D. Currie, Holger Petersen, 1999, J. Autom. Lang. Comb..

Unary patterns under permutations

James D. Currie, Florin Manea, Dirk Nowotka, 2018, Theor. Comput. Sci..

Suffix conjugates for a class of morphic subshifts pdf

James D. Currie, Narad Rampersad, Kalle Saari, 2013, Ergodic Theory and Dynamical Systems.

Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture pdf

James D. Currie, Narad Rampersad, Lucas Mol, 2018, Electron. J. Comb..

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101

James D. Currie, Jesse T. Johnson, 2021, Theor. Comput. Sci..

There Are Ternary Circular Square-Free Words of Length n for n >= 18

James D. Currie, J. Currie, 2002, Electron. J. Comb..

The complexity of the simplex algorithm

James D. Currie, 1984 .

The Thue-Morse word contains circular 5/2+ power free words of every length

James D. Currie, Ali Aberkane, 2005, Theor. Comput. Sci..

Dejean's conjecture and Sturmian words

James D. Currie, Morteza Mohammad Noori, J. Currie, 2007, Eur. J. Comb..

Infinite words containing squares at every position

James D. Currie, Narad Rampersad, J. Currie, 2008, RAIRO Theor. Informatics Appl..

Palindrome positions in ternary square-free words

James D. Currie, 2008, Theor. Comput. Sci..

A proof of Dejean's conjecture

James D. Currie, Narad Rampersad, J. Currie, 2009, Math. Comput..

Extremal Infinite Overlap-Free Binary Words

Jeffrey Shallit, James D. Currie, Jean-Paul Allouche, 1998, Electron. J. Comb..

Dejean's conjecture holds for $\sf {N\ge 27}$

James D. Currie, Narad Rampersad, J. Currie, 2009, RAIRO Theor. Informatics Appl..

What Is the Abelian Analogue of Dejean's Conjecture?

James D. Currie, 2003, Grammars and Automata for String Processing.

Avoidability Index for Binary Patterns with Reversal

James D. Currie, Philip Lafrance, 2016, Electron. J. Comb..

Avoidance bases for formulas with reversal

James D. Currie, Narad Rampersad, Lucas Mol, 2018, Theor. Comput. Sci..

For each α > 2 there is an Infinite Binary Word with Critical Exponent α

James D. Currie, Narad Rampersad, J. Currie, 2008, Electron. J. Comb..

There are k-uniform cubefree binary morphisms for all k>=0

James D. Currie, Narad Rampersad, 2009, Discret. Appl. Math..

Infinite ternary square-free words concatenated from permutations of a single word

James D. Currie, 2013, Theor. Comput. Sci..

Dejean's conjecture holds for n>=30

James D. Currie, Narad Rampersad, J. Currie, 2008, Theor. Comput. Sci..

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

James D. Currie, Narad Rampersad, Francine Blanchet-Sadri, 2014, Integers.

Which graphs allow infinite nonrepetitive walks?

James D. Currie, 1991, Discret. Math..

Fixed points avoiding Abelian k-powers

James D. Currie, Narad Rampersad, J. Currie, 2011, J. Comb. Theory, Ser. A.

Cubefree words with many squares

James D. Currie, Narad Rampersad, J. Currie, 2008, Discret. Math. Theor. Comput. Sci..

A word on 7 letters which is non-repetitive up to mod 5

James D. Currie, Erica Moodie, 2003, Acta Informatica.

Pattern avoidance with involution pdf

James D. Currie, 2011, ArXiv.

A family of formulas with reversal of high avoidability index

James D. Currie, Narad Rampersad, Lucas Mol, 2016, Int. J. Algebra Comput..

The Least Self-Shuffle of the Thue-Morse Sequence

James D. Currie, 2014, J. Integer Seq..

Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words pdf

James D. Currie, 2019, ArXiv.

Non-Repetitive Tilings

James D. Currie, Jamie Simpson, 2002, Electron. J. Comb..

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111)

Maxime Crochemore, James D. Currie, Gregory Kucherov, 2014, Dagstuhl Reports.

Growth rate of binary words avoiding xxxR pdf

James D. Currie, Narad Rampersad, 2016, Theor. Comput. Sci..

Long binary patterns are Abelian 2-avoidable

James D. Currie, Terry I. Visentin, T. Visentin, 2008, Theor. Comput. Sci..

The undirected repetition threshold pdf

James D. Currie, Lucas Mol, 2019, WORDS.

Lexicographically least words in the orbit closure of the Rudin-Shapiro word

James D. Currie, 2011, Theor. Comput. Sci..

A Note on Antichains of Words

James D. Currie, 1995, Electron. J. Comb..

The set of k-power free words over sigma is empty or perfect,

James D. Currie, Robert O. Shelton, 2003, Eur. J. Comb..

Pattern avoidance: themes and variations

James D. Currie, J. Currie, 2005, Theor. Comput. Sci..

The repetition threshold for binary rich words pdf

James D. Currie, Narad Rampersad, Lucas Mol, 2019, Discret. Math. Theor. Comput. Sci..

A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$

James D. Currie, 2016, Electron. J. Comb..

Counting Endomorphisms of Crown-like Orders

James D. Currie, Terry I. Visentin, 2002, Order.

Unary Patterns with involution

James D. Currie, Dirk Nowotka, Bastian Bischoff, 2012, Int. J. Found. Comput. Sci..

No iterated morphism generates any Arshon sequence of odd order

James D. Currie, 2002, Discret. Math..

There are level ternary circular square-free words of length $n$ for $n\ne 5,7,9,10,14,17.$

James D. Currie, Jesse T. Johnson, J. Currie, 2020, 2005.06235.

A characterization of fractionally well-covered graphs

James D. Currie, Richard Nowakowski, 1991 .

Avoiding Patterns in the Abelian Sense

James D. Currie, V. Linek, J. Currie, 2001, Canadian Journal of Mathematics.

For each $\alpha$ > 2 there is an infinite binary word with critical exponent $\alpha$

James D. Currie, Narad Rampersad, 2008 .

The number of order-preserving maps of fences and crowns

James D. Currie, Terry Visentin, 1991 .

The metric dimension and metric independence of a graph

James D. Currie, Ortrud R. Oellerman, 2001 .

Open problems in pattern avoidance

James D. Currie, J. Currie, 1993 .

Open problems in pattern avoidance

James D. Currie, J. Currie, 1993 .

Attainable lengths for circular binary words avoiding $k$ powers

James D. Currie, Ali Aberkane, A. Aberkane, 2005 .

The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially

James D. Currie, Narad Rampersad, Ali Aberkane, 2004 .