Narad Rampersad

	2009
32		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
31		James D. Currie, Narad Rampersad: A proof of Dejean's conjecture CoRR abs/0905.1129: (2009)
30		Narad Rampersad, Jeffrey Shallit: Detecting patterns in finite regular and context-free languages CoRR abs/0906.3220: (2009)
29		Narad Rampersad, Jeffrey Shallit, Z. Xu: The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages CoRR abs/0907.0159: (2009)
28		Narad Rampersad: Further applications of a power series method for pattern avoidance CoRR abs/0907.4667: (2009)
27		Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit: Automata and Reduced Words in the Free Group CoRR abs/0910.4555: (2009)
26		James D. Currie, Narad Rampersad: There are k-uniform cubefree binary morphisms for all k>=0. Discrete Applied Mathematics 157(11): 2548-2551 (2009)
25		James D. Currie, Narad Rampersad: Dejean's conjecture holds for $\sf {N\ge 27}$. ITA 43(4): 775-778 (2009)
24		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)
23		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)
22		Narad Rampersad, Nicolae Santean, Jeffrey Shallit, Bala Ravikumar: State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009)
21		Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009)
20		James D. Currie, Narad Rampersad: Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410(30-32): 2885-2888 (2009)
	2008
19		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
18		Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63
17		Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence CoRR abs/0808.1657: (2008)
16		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)
15		Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008)
14		Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit, Manuel Silva: Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008)
	2007
13		Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289
12		Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite automata, palindromes, patterns, and borders CoRR abs/0711.3183: (2007)
11		Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the growth rate of a regular language in polynomial time CoRR abs/0711.4990: (2007)
10		Narad Rampersad: On the context-freeness of the set of words containing overlaps. Inf. Process. Lett. 102(2-3): 74-78 (2007)
	2006
9		James D. Currie, Narad Rampersad, Jeffrey Shallit: Binary Words Containing Infinitely Many Overlaps. Electr. J. Comb. 13(1): (2006)
8		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)
7		Narad Rampersad: The state complexity of L2 and Lk. Inf. Process. Lett. 98(6): 231-234 (2006)
	2005
6		Narad Rampersad: Words avoiding 7/3-powers and the thue-morse morphism. Int. J. Found. Comput. Sci. 16(4): 755-766 (2005)
5		Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005)
	2004
4		Narad Rampersad: Words Avoiding 7/3-Powers and the Thue-Morse Morphism. Developments in Language Theory 2004: 357-367
3		Narad Rampersad: The state complexity of L2 and Lk CoRR cs.CC/0410032: (2004)
	2003
2		Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Cubefree binary words avoiding long squares CoRR math.CO/0302303: (2003)
1		Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words CoRR math.CO/0306081: (2003)

Coauthor Index

1	Jean-Paul Allouche	[17] [21]
2	Terry Anderson	[12] [18] [24]
3	Thomas Ang	[27]
4	Brandon Blakeley	[32]
5	Francine Blanchet-Sadri	[32]
6	Shandy Brown	[8]
7	James D. Currie	[9] [20] [25] [26] [31]
8	Pawel Gawrychowski	[19]
9	Josh Gunter	[32]
10	Jui-Yi Kao	[14] [16]
11	Dalia Krieger	[11] [13] [19] [23]
12	John Loftus	[24]
13	Andrew J. Malton	[16]
14	Avery Miller	[23]
15	Pascal Ochem	[13] [15]
16	Giovanni Pighizzini	[27]
17	Bala Ravikumar	[22] [23]
18	Nicolae Santean	[12] [18] [22] [24]
19	Jeffrey Shallit	[1] [2] [5] [8] [9] [11] [12] [13] [14] [15] [16] [17] [18] [19] [21] [22] [23] [24] [27] [29] [30]
20	Manuel Silva	[14]
21	Troy Vasiga	[8]
22	Ming-wei Wang	[1] [2] [5]
23	Z. Xu	[29]

Colors in the list of coauthors