A proof of Dejean’s conjecture J Currie, N Rampersad Mathematics of Computation 80 (274), 1063-1070, 2011 | 85 | 2011 |

Periodicity, repetitions, and orbits of an automatic sequence JP Allouche, N Rampersad, J Shallit Theoretical Computer Science 410 (30-32), 2795-2803, 2009 | 68 | 2009 |

Enumeration and decidable properties of automatic sequences É Charlier, N Rampersad, J Shallit International Journal of Foundations of Computer Science 23 (05), 1035-1066, 2012 | 60 | 2012 |

Avoiding large squares in infinite binary words N Rampersad, J Shallit, M Wang Theoretical Computer Science 339 (1), 19-34, 2005 | 53 | 2005 |

On NFAs where all states are final, initial, or both JY Kao, N Rampersad, J Shallit Theoretical Computer Science 410 (47-49), 5010-5021, 2009 | 50 | 2009 |

The state complexity of L2 and Lk N Rampersad Information Processing Letters 98 (6), 231-234, 2006 | 48 | 2006 |

The abelian complexity of the paperfolding word B Madill, N Rampersad Discrete Mathematics 313 (7), 831-838, 2013 | 39 | 2013 |

The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages N Rampersad, J Shallit, Z Xu fundamenta informaticae 116 (1-4), 223-236, 2012 | 35 | 2012 |

Dejean's conjecture holds for n≥ 27 J Currie, N Rampersad RAIRO-Theoretical Informatics and Applications 43 (4), 775-778, 2009 | 33 | 2009 |

Dejean's conjecture holds for n>= 30 J Currie, N Rampersad arXiv preprint arXiv:0806.0043, 2008 | 30 | 2008 |

The number of ternary words avoiding abelian cubes grows exponentially A Aberkane, JD Currie, N Rampersad J. Integer Seq 7 (2), 2004 | 26 | 2004 |

Recurrent words with constant Abelian complexity J Currie, N Rampersad arXiv preprint arXiv:0911.5151, 2009 | 25 | 2009 |

Finding the growth rate of a regular or context-free language in polynomial time P Gawrychowski, D Krieger, N Rampersad, J Shallit International Journal of Foundations of Computer Science 21 (04), 597-618, 2010 | 24 | 2010 |

Finding the growth rate of a regular of context-free language in polynomial time P Gawrychowski, D Krieger, N Rampersad, J Shallit International Conference on Developments in Language Theory, 339-358, 2008 | 21 | 2008 |

Decimations of languages and state complexity D Krieger, A Miller, N Rampersad, B Ravikumar, J Shallit Theoretical computer science 410 (24-25), 2401-2409, 2009 | 20 | 2009 |

Further applications of a power series method for pattern avoidance N Rampersad arXiv preprint arXiv:0907.4667, 2009 | 19 | 2009 |

Fixed points avoiding Abelian k-powers JD Currie, N Rampersad Journal of Combinatorial Theory, Series A 119 (5), 942-948, 2012 | 18 | 2012 |

Enumeration and decidable properties of automatic sequences É Charlier, N Rampersad, J Shallit International Conference on Developments in Language Theory, 165-179, 2011 | 18 | 2011 |

Words avoiding reversed subwords N Rampersad, J Shallit arXiv preprint math/0311121, 2003 | 18 | 2003 |

Abelian complexity of fixed point of morphism 0↦ 012, 1↦ 02, 2↦ 1 F Blanchet-Sadri, JD Currie, N Rampersad, N Fox Integers, 2014 | 17 | 2014 |