Narad Rampersad

Blake Madill, Narad Rampersad: The abelian complexity of the paperfolding word. Discrete Mathematics 313(7): 831-838 (2013)

Anne Lacroix, Narad Rampersad: Automaticity of Primitive Words and Irreducible Polynomials. Discrete Mathematics & Theoretical Computer Science 15(1): 29-36 (2013)

James D. Currie, Narad Rampersad, Kalle Saari: Extremal words in the shift orbit closure of a morphic sequence. CoRR abs/1301.4972 (2013)

Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme: Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Inform. 116(1-4): 175-187 (2012)

Narad Rampersad, Jeffrey Shallit, Zhi Xu: The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Inform. 116(1-4): 223-236 (2012)

Michael Domaratzki, Narad Rampersad: Abelian Primitive Words. Int. J. Found. Comput. Sci. 23(5): 1021-1034 (2012)

Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23(5): 1035-1066 (2012)

Emilie Charlier, Anne Lacroix, Narad Rampersad: Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO - Theor. Inf. and Applic. 46(1): 51-65 (2012)

James D. Currie, Narad Rampersad: Fixed points avoiding Abelian k-powers. J. Comb. Theory, Ser. A 119(5): 942-948 (2012)

Blake Madill, Narad Rampersad: The abelian complexity of the paperfolding word. CoRR abs/1208.2856 (2012)

Narad Rampersad: Further Applications of a Power Series Method for Pattern Avoidance. Electr. J. Comb. 18(1) (2011)

Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Inverse star, borders, and palstars. Inf. Process. Lett. 111(9): 420-422 (2011)

James D. Currie, Narad Rampersad: A proof of Dejean's conjecture. Math. Comput. 80(274): 1063-1070 (2011)

Emilie Charlier, Narad Rampersad: The growth function of S-recognizable sets. Theor. Comput. Sci. 412(39): 5400-5408 (2011)

Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory 2011: 165-179

Michael Domaratzki, Narad Rampersad: Abelian Primitive Words. Developments in Language Theory 2011: 204-215

Narad Rampersad, Elise Vaslet: On Highly Repetitive and Power Free Words. Developments in Language Theory 2011: 441-451

Narad Rampersad: Abstract Numeration Systems. LATA 2011: 65-79

Narad Rampersad, Jeffrey O. Shallit, A. Shur: Fife's Theorem for (7/3)-Powers. WORDS 2011: 189-198

Emilie Charlier, Narad Rampersad: The growth function of S-recognizable sets. CoRR abs/1101.0036 (2011)

Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. CoRR abs/1102.3698 (2011)

James D. Currie, Narad Rampersad: Fixed points avoiding Abelian $k$-powers. CoRR abs/1106.1842 (2011)

Narad Rampersad, Jeffrey Shallit: Shuffling and Unshuffling. CoRR abs/1106.5767 (2011)

James D. Currie, Narad Rampersad: Cubefree words with many squares. Discrete Mathematics & Theoretical Computer Science 12(3): 29-34 (2010)

Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. 21(4): 597-618 (2010)

Narad Rampersad, Jeffrey Shallit: Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. 110(3): 108-112 (2010)

James D. Currie, Narad Rampersad: Infinite words containing squares at every position. RAIRO - Theor. Inf. and Applic. 44(1): 113-124 (2010)

Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad: On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. 411(49): 4263-4271 (2010)

Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler: State Complexity of Testing Divisibility. DCFS 2010: 48-57

Michael Domaratzki, Narad Rampersad: Abelian Primitive Words. CoRR abs/1006.4104 (2010)

Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Inverse Star, Borders, and Palstars. CoRR abs/1008.2440 (2010)

Emilie Charlier, Anne Lacroix, Narad Rampersad: Multi-dimensional sets recognizable in all abstract numeration systems. CoRR abs/1010.5391 (2010)

James D. Currie, Narad Rampersad: There are k-uniform cubefree binary morphisms for all k>=0. Discrete Applied Mathematics 157(11): 2548-2551 (2009)

Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11): 1096-1118 (2009)

James D. Currie, Narad Rampersad: Dejean's conjecture holds for $\sf {N\ge 27}$. ITA 43(4): 775-778 (2009)

Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit: Decimations of languages and state complexity. Theor. Comput. Sci. 410(24-25): 2401-2409 (2009)

Narad Rampersad, Nicolae Santean, Jeffrey Shallit, Bala Ravikumar: State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009)

Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009)

James D. Currie, Narad Rampersad: Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410(30-32): 2885-2888 (2009)

Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit: On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(47-49): 5010-5021 (2009)

Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad: On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory 2009: 113-124

James D. Currie, Narad Rampersad: A proof of Dejean's conjecture. CoRR abs/0905.1129 (2009)

Narad Rampersad, Jeffrey Shallit: Detecting patterns in finite regular and context-free languages. CoRR abs/0906.3220 (2009)

Narad Rampersad, Jeffrey Shallit, Zhi Xu: The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. CoRR abs/0907.0159 (2009)

Narad Rampersad: Further applications of a power series method for pattern avoidance. CoRR abs/0907.4667 (2009)

Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit: Automata and Reduced Words in the Free Group. CoRR abs/0910.4555 (2009)

James D. Currie, Narad Rampersad: For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electr. J. Comb. 15(1) (2008)

Narad Rampersad: Avoiding Sufficiently Large Binary Patterns. Bulletin of the EATCS 95: 241-245 (2008)

Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008)

Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit, Manuel Silva: Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008)

Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory 2008: 339-358

Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63

Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence. CoRR abs/0808.1657 (2008)

Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey Shallit: On NFAs Where All States are Final, Initial, or Both. CoRR abs/0808.2417 (2008)

Narad Rampersad: On the context-freeness of the set of words containing overlaps. Inf. Process. Lett. 102(2-3): 74-78 (2007)

Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289

Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite automata, palindromes, patterns, and borders. CoRR abs/0711.3183 (2007)

Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the growth rate of a regular language in polynomial time. CoRR abs/0711.4990 (2007)

James D. Currie, Narad Rampersad, Jeffrey Shallit: Binary Words Containing Infinitely Many Overlaps. Electr. J. Comb. 13(1) (2006)

Narad Rampersad: The state complexity of L² and L^k. Inf. Process. Lett. 98(6): 231-234 (2006)

Shandy Brown, Narad Rampersad, Jeffrey Shallit, Troy Vasiga: Squares and overlaps in the Thue-Morse sequence and some variants. ITA 40(3): 473-484 (2006)

Narad Rampersad: Words avoiding 7/3-powers and the thue-morse morphism. Int. J. Found. Comput. Sci. 16(4): 755-766 (2005)

Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005)

Narad Rampersad: Words Avoiding 7/3-Powers and the Thue-Morse Morphism. Developments in Language Theory 2004: 357-367

Narad Rampersad: The state complexity of L² and L^k. CoRR cs.CC/0410032 (2004)

Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Cubefree binary words avoiding long squares. CoRR math.CO/0302303 (2003)

Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words. CoRR math.CO/0306081 (2003)