Narad Rampersad

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 71

Top Venues

CoRR

Theor. Comput. Sci.

J. Integer Seq.

RAIRO Theor. Informatics Appl.

Publications

James D. Currie, Narad Rampersad
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. RAIRO Theor. Informatics Appl. 58 (2024)
Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
Repetition Threshold for Binary Automatic Sequences. CoRR (2024)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57 (2023)
Narad Rampersad, Max Wiebe
Sums of products of binomial coefficients mod 2 and 2-regular sequences. CoRR (2023)
James D. Currie, Narad Rampersad
The analogue of overlap-freeness for the Fibonacci morphism. CoRR (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS (2023)
James D. Currie, Narad Rampersad
A small morphism giving Abelian repetition threshold less than 2. CoRR (2023)
Narad Rampersad, Jeffrey O. Shallit
Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR (2023)
James D. Currie, Narad Rampersad
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. CoRR (2023)
Narad Rampersad, Jeffrey O. Shallit
Rudin-Shapiro Sums via Automata Theory and Logic. WORDS (2023)
Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
-bonacci words. Theor. Comput. Sci. 918 (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Complement Avoidance in Binary Words. CoRR (2022)
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Antisquares and Critical Exponents. CoRR (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a Ternary Infinite Word. CoRR (2022)
Narad Rampersad, Jeffrey O. Shallit
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. 29 (3) (2022)
Narad Rampersad
The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word. CoRR (2021)
Lucas Mol, Narad Rampersad
Lengths of extremal square-free ternary words. Contributions Discret. Math. 16 (1) (2021)
Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32 (5) (2021)
Marko Milosevic, Narad Rampersad
Squarefree words with interior disposable factors. Theor. Comput. Sci. 863 (2021)
Narad Rampersad, Jeffrey O. Shallit
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR (2021)
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR (2021)
Narad Rampersad
Prefixes of the Fibonacci word that end with a cube. CoRR (2021)
Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
Closed Ziv-Lempel factorization of the m-bonacci words. CoRR (2021)
Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
An inequality for the number of periods in a word. CoRR (2020)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal overlap-free and extremal β-free binary words. CoRR (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27 (4) (2020)
Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential Length Universality. STACS (2020)
Lucas Mol, Narad Rampersad
The weak circular repetition threshold over large alphabets. RAIRO Theor. Informatics Appl. 54 (2020)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. 23 (3) (2020)
Marko Milosevic, Narad Rampersad
Squarefree words with interior disposable factors. CoRR (2020)
Lucas Mol, Narad Rampersad
Lengths of extremal square-free ternary words. CoRR (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30 (8) (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. CoRR (2019)
James D. Currie, Lucas Mol, Narad Rampersad
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. 26 (2) (2019)
Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
Critical exponents of infinite balanced words. Theor. Comput. Sci. 777 (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. CoRR (2019)
Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
New Results on Pseudosquare Avoidance. WORDS (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799 (2019)
Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
New results on pseudosquare avoidance. CoRR (2019)
Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
-bonacci infinite words. Theor. Comput. Sci. 790 (2019)
Lucas Mol, Narad Rampersad
The Weak Circular Repetition Threshold Over Large Alphabets. CoRR (2019)
Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words. CoRR (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR (2019)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
Cobham's Theorem and Automaticity. CoRR (2018)
Narad Rampersad, Jeffrey O. Shallit
Common factors in automatic and Sturmian sequences. CoRR (2018)
James D. Currie, Lucas Mol, Narad Rampersad
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738 (2018)
Jeremy Nicholson, Narad Rampersad
Improved Estimates for the Number of Privileged Words. J. Integer Seq. 21 (3) (2018)
Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
Critical exponents of infinite balanced words. CoRR (2018)
Adam Borchert, Narad Rampersad
Permutation complexity of images of Sturmian words by marked morphisms. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Narad Rampersad, Manon Stipulanti
The Formal Inverse of the Period-Doubling Sequence. J. Integer Seq. 21 (9) (2018)
Colin Krawchuk, Narad Rampersad
Cyclic Complexity of Some Infinite Words and Generalizations. Integers (2018)
Narad Rampersad, Manon Stipulanti
The Formal Inverse of the Period-Doubling Sequence. CoRR (2018)
James D. Currie, Lucas Mol, Narad Rampersad
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR (2018)
James D. Currie, Lucas Mol, Narad Rampersad
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51 (4) (2017)
Narad Rampersad
Formulas with Reversal. CiE (2017)
James D. Currie, Lucas Mol, Narad Rampersad
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27 (5) (2017)
Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential length universality. CoRR (2017)
Adam Borchert, Narad Rampersad
Permutation complexity of images of Sturmian words by marked morphisms. CoRR (2017)
Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit
Overpals, Underlaps, and Underpals. WORDS (2017)
Jeremy Nicholson, Narad Rampersad
Initial non-repetitive complexity of infinite words. Discret. Appl. Math. 208 (2016)
James D. Currie, Narad Rampersad
. Theor. Comput. Sci. 609 (2016)
Jeremy Nicholson, Narad Rampersad
The Frobenius problem for the shuffle operation. CoRR (2016)
James D. Currie, Narad Rampersad
. CoRR (2015)
James D. Currie, Narad Rampersad
Binary words avoiding xx^Rx and strongly unimodal sequences. CoRR (2015)
Jeremy Nicholson, Narad Rampersad
Non-repetitive complexity of infinite words. CoRR (2015)
Philip Lafrance, Narad Rampersad, Randy Yee
Some properties of a Rudin-Shapiro-like sequence. Adv. Appl. Math. 63 (2015)
Adam Borchert, Narad Rampersad
Words with many palindrome pair factors. CoRR (2015)
Adam Borchert, Narad Rampersad
Words with many Palindrome Pair Factors. Electron. J. Comb. 22 (4) (2015)
James D. Currie, Narad Rampersad
Binary Words Avoiding x xR x and Strongly Unimodal Sequences. J. Integer Seq. 18 (10) (2015)
Narad Rampersad, Michel Rigo, Pavel Salimov
A note on abelian returns in rotation words. Theor. Comput. Sci. 528 (2014)
Daniel Goc, Narad Rampersad, Michel Rigo, Pavel Salimov
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). Int. J. Found. Comput. Sci. 25 (8) (2014)
Philip Lafrance, Narad Rampersad, Randy Yee
Some properties of a Rudin-Shapiro-like sequence. CoRR (2014)
Francine Blanchet-Sadri, Nathan Fox, Narad Rampersad
On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. 61 (2014)
James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
Extremal words in morphic subshifts. Discret. Math. 322 (2014)
Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers 14 (2014)
Narad Rampersad
Non-constructive Methods for Avoiding Repetitions in Words. WORDS (2013)
Blake Madill, Narad Rampersad
The abelian complexity of the paperfolding word. Discret. Math. 313 (7) (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Suffix conjugates for a class of morphic subshifts. CoRR (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Extremal words in the shift orbit closure of a morphic sequence CoRR (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory (2013)
Anne Lacroix, Narad Rampersad
Automaticity of Primitive Words and Irreducible Polynomials. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Narad Rampersad, Michel Rigo, Pavel Salimov
On the Number of Abelian Bordered Words. Developments in Language Theory (2013)
James D. Currie, Narad Rampersad, Kalle Saari
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS (2013)
Dane Henshall, Narad Rampersad, Jeffrey O. Shallit
Shuffling and Unshuffling. Bull. EATCS 107 (2012)
Michael Domaratzki, Narad Rampersad
Abelian Primitive Words. Int. J. Found. Comput. Sci. 23 (5) (2012)
Blake Madill, Narad Rampersad
The abelian complexity of the paperfolding word CoRR (2012)
James D. Currie, Narad Rampersad
Fixed points avoiding Abelian k-powers. J. Comb. Theory, Ser. A 119 (5) (2012)
Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23 (5) (2012)
Emilie Charlier, Anne Lacroix, Narad Rampersad
Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae 116 (1-4) (2012)
Narad Rampersad, Jeffrey O. Shallit, Zhi Xu
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae 116 (1-4) (2012)
Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
Inverse star, borders, and palstars. Inf. Process. Lett. 111 (9) (2011)
James D. Currie, Narad Rampersad
Fixed points avoiding Abelian $k$-powers CoRR (2011)
Michael Domaratzki, Narad Rampersad
Abelian Primitive Words. Developments in Language Theory (2011)
Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory (2011)
Émilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler
The Minimal Automaton Recognizing mN in a Linear Numeration System. Integers (2011)
Narad Rampersad, Jeffrey O. Shallit
Shuffling and Unshuffling CoRR (2011)
James D. Currie, Narad Rampersad
A proof of Dejean's conjecture. Math. Comput. 80 (274) (2011)

Narad Rampersad.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Narad Rampersad