According to our database
1,
James D. Currie
authored at least 81 papers
between 1991 and 2024.
Collaborative distances:
2024
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2.
RAIRO Theor. Informatics Appl., 2024
2023
Properties of a ternary infinite word.
RAIRO Theor. Informatics Appl., 2023
A small morphism giving Abelian repetition threshold less than 2.
CoRR, 2023
The analogue of overlap-freeness for the Fibonacci morphism.
CoRR, 2023
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold.
CoRR, 2023
The analogue of overlap-freeness for the period-doubling sequence.
CoRR, 2023
2022
Complement Avoidance in Binary Words.
CoRR, 2022
Antisquares and Critical Exponents.
CoRR, 2022
2021
The undirected repetition threshold and undirected pattern avoidance.
Theor. Comput. Sci., 2021
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101.
Theor. Comput. Sci., 2021
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.
CoRR, 2021
2020
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.
J. Integer Seq., 2020
The repetition threshold for binary rich words.
Discret. Math. Theor. Comput. Sci., 2020
2019
Some further results on squarefree arithmetic progressions in infinite words.
Theor. Comput. Sci., 2019
Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words.
J. Integer Seq., 2019
Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words.
CoRR, 2019
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.
Electron. J. Comb., 2019
The Undirected Repetition Threshold.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019
2018
Avoidance bases for formulas with reversal.
Theor. Comput. Sci., 2018
Unary patterns under permutations.
Theor. Comput. Sci., 2018
2017
On avoidability of formulas with reversal.
RAIRO Theor. Informatics Appl., 2017
A family of formulas with reversal of high avoidability index.
Int. J. Algebra Comput., 2017
2016
Growth rate of binary words avoiding xxx<sup>R</sup>.
Theor. Comput. Sci., 2016
Avoidability Index for Binary Patterns with Reversal.
Electron. J. Comb., 2016
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$.
Electron. J. Comb., 2016
2015
Binary Words Avoiding x xR x and Strongly Unimodal Sequences.
J. Integer Seq., 2015
Binary words avoiding xx^Rx and strongly unimodal sequences.
CoRR, 2015
Unary Patterns with Permutations.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
2014
The Least Self-Shuffle of the Thue-Morse Sequence.
J. Integer Seq., 2014
Avoiding Three Consecutive Blocks of the Same Size and Same Sum.
J. ACM, 2014
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.
Integers, 2014
Extremal words in morphic subshifts.
Discret. Math., 2014
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014
Square-free Words with Square-free Self-shuffles.
Electron. J. Comb., 2014
2013
Infinite ternary square-free words concatenated from permutations of a single word.
Theor. Comput. Sci., 2013
Suffix conjugates for a class of morphic subshifts.
CoRR, 2013
Extremal Words in the Shift Orbit Closure of a Morphic Sequence.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract).
Proceedings of the Combinatorics on Words - 9th International Conference, 2013
2012
Fixed points avoiding Abelian k-powers.
J. Comb. Theory, Ser. A, 2012
Unary Patterns with involution.
Int. J. Found. Comput. Sci., 2012
2011
Lexicographically least words in the orbit closure of the Rudin-Shapiro word.
Theor. Comput. Sci., 2011
A proof of Dejean's conjecture.
Math. Comput., 2011
Pattern avoidance with involution
CoRR, 2011
Recurrent words with constant Abelian complexity.
Adv. Appl. Math., 2011
2010
Infinite words containing squares at every position.
RAIRO Theor. Informatics Appl., 2010
Cubefree words with many squares.
Discret. Math. Theor. Comput. Sci., 2010
2009
Dejean's conjecture holds for n>=30.
Theor. Comput. Sci., 2009
A cyclic binary morphism avoiding Abelian fourth powers.
Theor. Comput. Sci., 2009
Least Periods of Factors of Infinite Words.
RAIRO Theor. Informatics Appl., 2009
Dejean's conjecture holds for $\sf {N\ge 27}$.
RAIRO Theor. Informatics Appl., 2009
There are k-uniform cubefree binary morphisms for all k>=0.
Discret. Appl. Math., 2009
The lexicographically least word in the orbit closure of the Rudin-Shapiro word
CoRR, 2009
Dejean's conjecture holds for n>=27.
CoRR, 2009
2008
Long binary patterns are Abelian 2-avoidable.
Theor. Comput. Sci., 2008
Palindrome positions in ternary square-free words.
Theor. Comput. Sci., 2008
For each α > 2 there is an Infinite Binary Word with Critical Exponent α.
Electron. J. Comb., 2008
2007
Dejean's conjecture and Sturmian words.
Eur. J. Comb., 2007
On Abelian 2-avoidable binary patterns.
Acta Informatica, 2007
2006
Binary Words Containing Infinitely Many Overlaps.
Electron. J. Comb., 2006
2005
Pattern avoidance: themes and variations.
Theor. Comput. Sci., 2005
The Thue-Morse word contains circular 5/2+ power free words of every length.
Theor. Comput. Sci., 2005
2004
The number of binary words avoiding abelian fourth powers grows exponentially.
Theor. Comput. Sci., 2004
There Exist Binary Circular 5/2<sup>+</sup> Power Free Words of Every Length.
Electron. J. Comb., 2004
2003
The set of k-power free words over sigma is empty or perfect, .
Eur. J. Comb., 2003
The Fixing Block Method in Combinatorics on Words.
Comb., 2003
A word on 7 letters which is non-repetitive up to mod 5.
Acta Informatica, 2003
What Is the Abelian Analogue of Dejean's Conjecture?
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003
2002
Counting Endomorphisms of Crown-like Orders.
Order, 2002
No iterated morphism generates any Arshon sequence of odd order.
Discret. Math., 2002
There Are Ternary Circular Square-Free Words of Length n for n >= 18.
Electron. J. Comb., 2002
Circular Words Avoiding Patterns.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002
1999
Separating Words with Small Grammars.
J. Autom. Lang. Comb., 1999
Words Strongly Avoiding Fractional Powers.
Eur. J. Comb., 1999
1998
Extremal Infinite Overlap-Free Binary Words.
Electron. J. Comb., 1998
1996
Cantor Sets and Dejean's Conjecture.
J. Autom. Lang. Comb., 1996
Non-Repetitive Words: Ages and Essences.
Comb., 1996
1995
On the structure and extendibility of k-power free words.
Eur. J. Comb., 1995
A Note on Antichains of Words.
Electron. J. Comb., 1995
1992
Connectivity of distance graphs.
Discret. Math., 1992
1991
Which graphs allow infinite nonrepetitive walks?
Discret. Math., 1991
