Currie, James D.

1. For each α > 2 there is an infinite binary word with critical exponent α
   2008/02/27 by Currie, James D., Rampersad, Narad · 1 citation
   #68R15 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)
2. Fixed points avoiding Abelian k-powers
   2011/06/09 by James D. Currie, Narad Rampersad, Currie, James D. +1 · 2 citations
   Computer Science · #68R15 #Advanced Algebra and Logic #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
3. Avoiding Three Consecutive Blocks of the Same Size and Same Sum
   2011/06/26 by Cassaigne, Julien, Currie, James D., Schaeffer, Luke +1 · 2 citations
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. A ternary square-free sequence avoiding factors equivalent to abcacba
   2016/03/09 by Currie, James D. · 1 citation
   #68R15 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
5. The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27
   2019/11/13 by Currie, James D., Mol, Lucas, Rampersad, Narad · 1 citation
   #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
6. The repetition threshold for ternary rich words
   2024/09/18 by Currie, James D., Mol, Lucas, Peltomäki, Jarkko · 3 citations
   #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)