Computer Science – Formal Languages and Automata Theory
Scientist
Computer Science
Formal Languages and Automata Theory
Scientist
Department of Mathematics, University of Liège
A note on avoidable words in squarefree ternary words
A note on non-repetitive colourings of planar graphs
A proof of Dejean's conjecture
Abelian Primitive Words
Automata and Reduced Words in the Free Group
No associations
LandOfFree
Narad Rampersad does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Narad Rampersad, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Narad Rampersad will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-85301