BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × France
1 × Germany
1 × Italy
1 × Japan
1 × New Zealand
2 × Spain
Collaborated with:
J.Shallit M.Domaratzki D.Krieger E.Charlier M.Rigo P.Salimov P.Ochem E.Vaslet P.Gawrychowski J.D.Currie K.Saari D.Goc B.Blakeley F.Blanchet-Sadri J.Gunter T.Anderson N.Santean
Talks about:
word (9) avoid (5) abelian (4) power (4) sequenc (3) automat (3) decid (3) free (3) properti (2) polynomi (2)

Person: Narad Rampersad

DBLP DBLP: Rampersad:Narad

Contributed to:

DLT 20132013
DLT 20132014
DLT 20112011
DLT 20112012
LATA 20112011
DLT 20092009
DLT 20082008
DLT 20082010
LATA 20082008
DLT 20072007
DLT 20072008
DLT 20042004
DLT 20042005

Wrote 17 papers:

DLT-2013-CurrieRS #sequence #word
Extremal Words in the Shift Orbit Closure of a Morphic Sequence (JDC, NR, KS), pp. 143–154.
DLT-2013-RampersadRS #on the #word
On the Number of Abelian Bordered Words (NR, MR, PS), pp. 420–432.
DLT-J-2013-GocRRS14 #automation #on the #word
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.
DLT-2011-CharlierRS #automation #decidability #sequence
Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 165–179.
DLT-2011-DomaratzkiR #word
Abelian Primitive Words (MD, NR), pp. 204–215.
DLT-2011-RampersadV #on the #word
On Highly Repetitive and Power Free Words (NR, EV), pp. 441–451.
DLT-J-2011-CharlierRS12 #automation #decidability #sequence
Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 1035–1066.
DLT-J-2011-DomaratzkiR12 #word
Abelian Primitive Words (MD, NR), pp. 1021–1034.
LATA-2011-Rampersad
Abstract Numeration Systems (NR), pp. 65–79.
DLT-2009-BlakeleyBGR #complexity #on the #set #word
On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLT-2008-GawrychowskiKRS #context-free grammar #polynomial
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 339–358.
DLT-J-2008-GawrychowskiKRS10 #context-free grammar #polynomial
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 597–618.
LATA-2008-AndersonRSS #automaton #finite
Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.
DLT-2007-KriegerORS #approximate
Avoiding Approximate Squares (DK, PO, NR, JS), pp. 278–289.
DLT-J-2007-OchemRS08 #approximate
Avoiding Approximate Squares (PO, NR, JS), pp. 633–648.
DLT-2004-Rampersad #morphism #word
Words Avoiding 7/3-Powers and the Thue-Morse Morphism (NR), pp. 357–367.
DLT-J-2004-Rampersad05 #morphism #word
Words avoiding 7/3-powers and the thue-morse morphism (NR), pp. 755–766.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.