James D. Currie

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 33

Top Venues

Publications

James D. Currie, Narad Rampersad
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. RAIRO Theor. Informatics Appl. 58 (2024)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57 (2023)
James D. Currie, Narad Rampersad
The analogue of overlap-freeness for the Fibonacci morphism. CoRR (2023)
James D. Currie, Narad Rampersad
A small morphism giving Abelian repetition threshold less than 2. CoRR (2023)
James D. Currie, Narad Rampersad
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. CoRR (2023)
James D. Currie
The analogue of overlap-freeness for the period-doubling sequence. CoRR (2023)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Complement Avoidance in Binary Words. CoRR (2022)
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Antisquares and Critical Exponents. CoRR (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a Ternary Infinite Word. CoRR (2022)
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR (2021)
James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866 (2021)
James D. Currie, Jesse T. Johnson
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101. Theor. Comput. Sci. 850 (2021)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. CoRR (2020)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. 23 (3) (2020)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. CoRR (2019)
James D. Currie, Lucas Mol
The Undirected Repetition Threshold. WORDS (2019)
James D. Currie, Lucas Mol, Narad Rampersad
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. 26 (2) (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. CoRR (2019)
James D. Currie
Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words. CoRR (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799 (2019)
James D. Currie, Lucas Mol
The undirected repetition threshold. CoRR (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR (2019)
James D. Currie
Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words. J. Integer Seq. 22 (8) (2019)
James D. Currie, Lucas Mol, Narad Rampersad
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738 (2018)
James D. Currie, Lucas Mol, Narad Rampersad
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR (2018)
James D. Currie, Florin Manea, Dirk Nowotka, Kamellia Reshadi
Unary patterns under permutations. Theor. Comput. Sci. 743 (2018)
James D. Currie, Lucas Mol, Narad Rampersad
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51 (4) (2017)
James D. Currie, Lucas Mol, Narad Rampersad
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27 (5) (2017)
James D. Currie
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$. Electron. J. Comb. 23 (2) (2016)
James D. Currie
A ternary square-free sequence avoiding factors equivalent to abcacba. CoRR (2016)
James D. Currie, Philip Lafrance
Avoidability Index for Binary Patterns with Reversal. Electron. J. Comb. 23 (1) (2016)
James D. Currie, Narad Rampersad
. Theor. Comput. Sci. 609 (2016)
James D. Currie, Narad Rampersad
. CoRR (2015)
James D. Currie, Narad Rampersad
Binary words avoiding xx^Rx and strongly unimodal sequences. CoRR (2015)
James D. Currie, Philip Lafrance
Avoidability index for binary patterns with reversal. CoRR (2015)
James D. Currie, Florin Manea, Dirk Nowotka
Unary Patterns with Permutations. DLT (2015)
James D. Currie, Narad Rampersad
Binary Words Avoiding x xR x and Strongly Unimodal Sequences. J. Integer Seq. 18 (10) (2015)
Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports 4 (3) (2014)
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61 (2) (2014)
James D. Currie, Kalle Saari
Square-free Words with Square-free Self-shuffles. Electron. J. Comb. 21 (1) (2014)
James D. Currie
The Least Self-Shuffle of the Thue-Morse Sequence. J. Integer Seq. 17 (10) (2014)
James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
Extremal words in morphic subshifts. Discret. Math. 322 (2014)
Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers 14 (2014)
James D. Currie
Infinite ternary square-free words concatenated from permutations of a single word. Theor. Comput. Sci. 482 (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Suffix conjugates for a class of morphic subshifts. CoRR (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Extremal words in the shift orbit closure of a morphic sequence CoRR (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS (2013)
Bastian Bischoff, James D. Currie, Dirk Nowotka
Unary Patterns with involution. Int. J. Found. Comput. Sci. 23 (8) (2012)
James D. Currie
Infinite ternary square-free words concatenated from permutations of a single word CoRR (2012)
James D. Currie, Narad Rampersad
Fixed points avoiding Abelian k-powers. J. Comb. Theory, Ser. A 119 (5) (2012)
James D. Currie, Narad Rampersad
Fixed points avoiding Abelian $k$-powers CoRR (2011)
James D. Currie
Pattern avoidance with involution CoRR (2011)
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
Avoiding Three Consecutive Blocks of the Same Size and Same Sum CoRR (2011)
James D. Currie, Narad Rampersad
A proof of Dejean's conjecture. Math. Comput. 80 (274) (2011)
James D. Currie
Lexicographically least words in the orbit closure of the Rudin-Shapiro word. Theor. Comput. Sci. 412 (35) (2011)
James D. Currie, Narad Rampersad
Recurrent words with constant Abelian complexity. Adv. Appl. Math. 47 (1) (2011)
James D. Currie, Narad Rampersad
Infinite words containing squares at every position. RAIRO Theor. Informatics Appl. 44 (1) (2010)
James D. Currie, Narad Rampersad
Cubefree words with many squares. Discret. Math. Theor. Comput. Sci. 12 (3) (2010)
James D. Currie, Narad Rampersad
A proof of Dejean's conjecture CoRR (2009)
James D. Currie, Kalle Saari
Least Periods of Factors of Infinite Words. RAIRO Theor. Informatics Appl. 43 (1) (2009)
James D. Currie, Ali Aberkane
A cyclic binary morphism avoiding Abelian fourth powers. Theor. Comput. Sci. 410 (1) (2009)
James D. Currie, Narad Rampersad
There are k-uniform cubefree binary morphisms for all k>=0. Discret. Appl. Math. 157 (11) (2009)
James D. Currie, Narad Rampersad
Dejean's conjecture holds for $\sf {N\ge 27}$. RAIRO Theor. Informatics Appl. 43 (4) (2009)
James D. Currie, Narad Rampersad
Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410 (30-32) (2009)
James D. Currie, Narad Rampersad
Dejean's conjecture holds for n>=27. CoRR (2009)
James D. Currie
The lexicographically least word in the orbit closure of the Rudin-Shapiro word CoRR (2009)
James D. Currie, Narad Rampersad
Infinite words containing squares at every position. CoRR (2008)
James D. Currie, Terry I. Visentin
Long binary patterns are Abelian 2-avoidable. Theor. Comput. Sci. 409 (3) (2008)
James D. Currie, Narad Rampersad
Cubefree words with many squares. CoRR (2008)
James D. Currie, Narad Rampersad
For each $α$ > 2 there is an infinite binary word with critical exponent $α$. CoRR (2008)
James D. Currie
Palindrome positions in ternary square-free words. Theor. Comput. Sci. 396 (1-3) (2008)
James D. Currie, Narad Rampersad
Dejean's conjecture holds for n >= 30. CoRR (2008)
James D. Currie, Narad Rampersad
For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electron. J. Comb. 15 (1) (2008)
James D. Currie, Narad Rampersad
There are k-uniform cubefree binary morphisms for all k >= 0. CoRR (2008)
Morteza Mohammad Noori, James D. Currie
Dejean's conjecture and Sturmian words. Eur. J. Comb. 28 (3) (2007)
James D. Currie, Terry I. Visentin
On Abelian 2-avoidable binary patterns. Acta Informatica 43 (8) (2007)
James D. Currie, Narad Rampersad, Jeffrey O. Shallit
Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. 13 (1) (2006)
James D. Currie
Pattern avoidance: themes and variations. Theor. Comput. Sci. 339 (1) (2005)
Ali Aberkane, James D. Currie
The Thue-Morse word contains circular 5/2+ power free words of every length. Theor. Comput. Sci. 332 (1-3) (2005)
Ali Aberkane, James D. Currie
Power Free Words of Every Length. Electron. J. Comb. 11 (1) (2004)
James D. Currie
The number of binary words avoiding abelian fourth powers grows exponentially. Theor. Comput. Sci. 319 (1-3) (2004)
James D. Currie, Cameron W. Pierce
The Fixing Block Method in Combinatorics on Words. Comb. 23 (4) (2003)
James D. Currie, Robert O. Shelton
The set of k-power free words over sigma is empty or perfect, . Eur. J. Comb. 24 (5) (2003)
James D. Currie, Erica Moodie
A word on 7 letters which is non-repetitive up to mod 5. Acta Informatica 39 (6-7) (2003)
James D. Currie
What Is the Abelian Analogue of Dejean's Conjecture? Grammars and Automata for String Processing (2003)
James D. Currie
There Are Ternary Circular Square-Free Words of Length n for n >= 18. Electron. J. Comb. 9 (1) (2002)
James D. Currie, D. Sean Fitzpatrick
Circular Words Avoiding Patterns. Developments in Language Theory (2002)
James D. Currie, Terry I. Visentin
Counting Endomorphisms of Crown-like Orders. Order 19 (4) (2002)
James D. Currie, Jamie Simpson
Non-Repetitive Tilings. Electron. J. Comb. 9 (1) (2002)
James D. Currie
No iterated morphism generates any Arshon sequence of odd order. Discret. Math. 259 (1-3) (2002)
James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4 (2) (1999)
Julien Cassaigne, James D. Currie
Words Strongly Avoiding Fractional Powers. Eur. J. Comb. 20 (8) (1999)
Jean-Paul Allouche, James D. Currie, Jeffrey O. Shallit
Extremal Infinite Overlap-Free Binary Words. Electron. J. Comb. 5 (1998)
James D. Currie
Non-Repetitive Words: Ages and Essences. Comb. 16 (1) (1996)
James D. Currie, Robert O. Shelton
Cantor Sets and Dejean's Conjecture. J. Autom. Lang. Comb. 1 (2) (1996)
James D. Currie
On the structure and extendibility of k-power free words. Eur. J. Comb. 16 (2) (1995)
James D. Currie, Robert O. Shelton
Cantor Sets and Dejean's Conjecture. Developments in Language Theory (1995)
James D. Currie
A Note on Antichains of Words. Electron. J. Comb. 2 (1995)

James D. Currie.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

James D. Currie