J. Currie

activity

20052023

most citedA proof of Dejean's conjecture

9 citations · 19 across the 17 of their papers we have counts for

collaborators

Showing cs.FLShow all

6 papers · 1 filter

cs.FL2019

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

James D. Currie

Let $S$ be one of ${aba, b c b}$ and ${aba, a c a}$ , and let $w$ be an infinite square-free word over $Σ = {a, b, c}$ with no factor in $S$ . Suppose that $f : Σ \to T^{*}$ is a non…

cs.FL2016

A ternary square-free sequence avoiding factors equivalent to $ab c a c ba$

James D. Currie

We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding le…

cs.FL2015★ 1 cited

Growth rate of binary words avoiding $xx x^{R}$

James D. Currie, Narad Rampersad

Consider the set of those binary words with no non-empty factors of the form $xx x^{R}$ . Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or expo…

cs.FL2012

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

James D. Currie

We answer a question of Harju: An infinite square-free ternary word with an $n$ -stem factorization exists for any $n \geq 13$ . We show that there are uniform ternary morphisms of len…

cs.FL2011

Fixed points avoiding Abelian $k$ -powers

James D. Currie, Narad Rampersad

We show that the problem of whether the fixed point of a morphism avoids Abelian $k$ -powers is decidable under rather general conditions

cs.FL2011★ 4 cited

Pattern avoidance with involution

James D. Currie

We give the avoidance indices (morphic and antimorphic) for all unary patterns with involution.

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

A ternary square-free sequence avoiding factors equivalent to abcacba

Growth rate of binary words avoiding xxxR

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

Fixed points avoiding Abelian k-powers

Pattern avoidance with involution

A ternary square-free sequence avoiding factors equivalent to $ab c a c ba$

Growth rate of binary words avoiding $xx x^{R}$

Fixed points avoiding Abelian $k$ -powers