Narad Rampersad
Narad Rampersad
Подтвержден адрес электронной почты в домене uwinnipeg.ca - Главная страница
Название
Процитировано
Процитировано
Год
A proof of Dejean’s conjecture
J Currie, N Rampersad
Mathematics of Computation 80 (274), 1063-1070, 2011
772011
Periodicity, repetitions, and orbits of an automatic sequence
JP Allouche, N Rampersad, J Shallit
Theoretical Computer Science 410 (30-32), 2795-2803, 2009
642009
Avoiding large squares in infinite binary words
N Rampersad, J Shallit, M Wang
Theoretical Computer Science 339 (1), 19-34, 2005
482005
Enumeration and decidable properties of automatic sequences
É Charlier, N Rampersad, J Shallit
International Journal of Foundations of Computer Science 23 (05), 1035-1066, 2012
472012
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
472009
The state complexity of L2 and Lk
N Rampersad
Information Processing Letters 98 (6), 231-234, 2006
472006
The abelian complexity of the paperfolding word
B Madill, N Rampersad
Discrete Mathematics 313 (7), 831-838, 2013
332013
Dejean's conjecture holds for n≥ 27
J Currie, N Rampersad
RAIRO-Theoretical Informatics and Applications 43 (4), 775-778, 2009
302009
Dejean's conjecture holds for n>= 30
J Currie, N Rampersad
arXiv preprint arXiv:0806.0043, 2008
262008
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
252012
Recurrent words with constant Abelian complexity
J Currie, N Rampersad
arXiv preprint arXiv:0911.5151, 2009
242009
The number of ternary words avoiding abelian cubes grows exponentially
A Aberkane, JD Currie, N Rampersad
J. Integer Seq 7 (2), 2004
242004
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
202008
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
182009
Fixed points avoiding Abelian k-powers
JD Currie, N Rampersad
Journal of Combinatorial Theory, Series A 119 (5), 942-948, 2012
172012
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
172010
Words avoiding reversed subwords
N Rampersad, J Shallit
arXiv preprint math/0311121, 2003
172003
On the complexity of deciding avoidability of sets of partial words
B Blakeley, F Blanchet-Sadri, J Gunter, N Rampersad
Theoretical computer science 411 (49), 4263-4271, 2010
152010
Further applications of a power series method for pattern avoidance
N Rampersad
arXiv preprint arXiv:0907.4667, 2009
152009
Squares and overlaps in the Thue-Morse sequence and some variants
S Brown, N Rampersad, J Shallit, T Vasiga
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2006
152006
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20