Cubefree binary words avoiding long squares - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (CoRR, 2003)

Words avoiding 7/3-powers and the thue-morse morphism. - Narad Rampersad (Int. J. Found. Comput. Sci., 2005)

Avoiding large squares in infinite binary words. - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (Theor. Comput. Sci., 2005)

Binary Words Containing Infinitely Many Overlaps. - James D. Currie; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2006)

The state complexity of L2 and Lk. - Narad Rampersad (Inf. Process. Lett., 2006)

Squares and overlaps in the Thue-Morse sequence and some variants. - Shandy Brown; Narad Rampersad; Jeffrey O. Shallit; Troy Vasiga (RAIRO Theor. Informatics Appl., 2006)

Avoiding Approximate Squares. - Dalia Krieger; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Developments in Language Theory, 2007)

Finite automata, palindromes, patterns, and borders - Terry Anderson; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (CoRR, 2007)

Finding the growth rate of a regular language in polynomial time - Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2007)

On the context-freeness of the set of words containing overlaps. - Narad Rampersad (Inf. Process. Lett., 2007)

Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Developments in Language Theory, 2008)

Finite Automata, Palindromes, Powers, and Patterns. - Terry Anderson; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (LATA, 2008)

For each α > 2 there is an Infinite Binary Word with Critical Exponent α. - James D. Currie; Narad Rampersad (Electron. J. Comb., 2008)

On NFAs Where All States are Final, Initial, or Both - Jui-Yi Kao; Andrew J. Malton; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2008)

Avoiding Sufficiently Large Binary Patterns. - Narad Rampersad (Bull. EATCS, 2008)

Avoiding Approximate Squares. - Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2008)

Words avoiding repetitions in arithmetic progressions. - Jui-Yi Kao; Narad Rampersad; Jeffrey O. Shallit; Manuel Silva 003 (Theor. Comput. Sci., 2008)

Dejean's conjecture holds for n>=27. - James D. Currie; Narad Rampersad (CoRR, 2009)

Automata and Reduced Words in the Free Group - Thomas Ang; Giovanni Pighizzini; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2009)

There are k-uniform cubefree binary morphisms for all k>=0. - James D. Currie; Narad Rampersad (Discret. Appl. Math., 2009)

Detecting palindromes, patterns and borders in regular languages. - Terry Anderson; John Loftus; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (Inf. Comput., 2009)

Dejean's conjecture holds for $ sf {N ge 27}$. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2009)

Periodicity, repetitions, and orbits of an automatic sequence. - Jean-Paul Allouche; Narad Rampersad; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

Dejean's conjecture holds for n>=30. - James D. Currie; Narad Rampersad (Theor. Comput. Sci., 2009)

On NFAs where all states are final, initial, or both. - Jui-Yi Kao; Narad Rampersad; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

Decimations of languages and state complexity. - Dalia Krieger; Avery Miller; Narad Rampersad; Bala Ravikumar; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

State complexity of unique rational operations. - Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit; Bala Ravikumar (Theor. Comput. Sci., 2009)

State Complexity of Testing Divisibility - Emilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (DCFS, 2010)

Cubefree words with many squares. - James D. Currie; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2010)

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2010)

Detecting patterns in finite regular and context-free languages. - Narad Rampersad; Jeffrey O. Shallit (Inf. Process. Lett., 2010)

Infinite words containing squares at every position. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2010)

On the complexity of deciding avoidability of sets of partial words. - Brandon Blakeley; Francine Blanchet-Sadri; Josh Gunter; Narad Rampersad (Theor. Comput. Sci., 2010)

On Highly Repetitive and Power Free Words. - Narad Rampersad; Elise Vaslet (Developments in Language Theory, 2011)

Abstract Numeration Systems. - Narad Rampersad (LATA, 2011)

Recurrent words with constant Abelian complexity. - James D. Currie; Narad Rampersad (Adv. Appl. Math., 2011)

Further Applications of a Power Series Method for Pattern Avoidance. - Narad Rampersad (Electron. J. Comb., 2011)

Fife's Theorem for (7/3)-Powers - Narad Rampersad; Jeffrey O. Shallit; Arseny M. Shur (WORDS, 2011)

Shuffling and Unshuffling - Narad Rampersad; Jeffrey O. Shallit (CoRR, 2011)

The Minimal Automaton Recognizing mN in a Linear Numeration System. - Émilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (Integers, 2011)

Inverse star, borders, and palstars. - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (Inf. Process. Lett., 2011)

A proof of Dejean's conjecture. - James D. Currie; Narad Rampersad (Math. Comput., 2011)

The growth function of S-recognizable sets. - Emilie Charlier; Narad Rampersad (Theor. Comput. Sci., 2011)

Shuffling and Unshuffling. - Dane Henshall; Narad Rampersad; Jeffrey O. Shallit (Bull. EATCS, 2012)

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. - Anne Lacroix; Narad Rampersad; Michel Rigo; Élise Vandomme (Fundam. Informaticae, 2012)

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. - Narad Rampersad; Jeffrey O. Shallit; Zhi Xu 002 (Fundam. Informaticae, 2012)

Enumeration and Decidable Properties of Automatic Sequences. - Emilie Charlier; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2012)

Abelian Primitive Words. - Michael Domaratzki; Narad Rampersad (Int. J. Found. Comput. Sci., 2012)

Multi-dimensional sets recognizable in all abstract numeration systems. - Emilie Charlier; Anne Lacroix; Narad Rampersad (RAIRO Theor. Informatics Appl., 2012)

Fixed points avoiding Abelian k-powers. - James D. Currie; Narad Rampersad (J. Comb. Theory A, 2012)

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). - James D. Currie; Narad Rampersad; Kalle Saari (WORDS, 2013)

Non-constructive Methods for Avoiding Repetitions in Words. - Narad Rampersad (WORDS, 2013)

Extremal Words in the Shift Orbit Closure of a Morphic Sequence. - James D. Currie; Narad Rampersad; Kalle Saari (Developments in Language Theory, 2013)

On the Number of Abelian Bordered Words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Developments in Language Theory, 2013)

Suffix conjugates for a class of morphic subshifts. - James D. Currie; Narad Rampersad; Kalle Saari (CoRR, 2013)

The abelian complexity of the paperfolding word. - Blake Madill; Narad Rampersad (Discret. Math., 2013)

Automaticity of Primitive Words and Irreducible Polynomials. - Anne Lacroix; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2013)

On the asymptotic abelian complexity of morphic words. - Francine Blanchet-Sadri; Nathan Fox; Narad Rampersad (Adv. Appl. Math., 2014)

Extremal words in morphic subshifts. - James D. Currie; Narad Rampersad; Kalle Saari; Luca Q. Zamboni (Discret. Math., 2014)

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). - Daniel Goc; Narad Rampersad; Michel Rigo; Pavel Salimov (Int. J. Found. Comput. Sci., 2014)

Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. - Francine Blanchet-Sadri; James D. Currie; Narad Rampersad; Nathan Fox (Integers, 2014)

A note on abelian returns in rotation words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2014)

Some properties of a Rudin-Shapiro-like sequence. - Philip Lafrance; Narad Rampersad; Randy Yee (Adv. Appl. Math., 2015)

Words with many Palindrome Pair Factors. - Adam Borchert; Narad Rampersad (Electron. J. Comb., 2015)

Binary words avoiding xx^Rx and strongly unimodal sequences. - James D. Currie; Narad Rampersad (CoRR, 2015)

Non-repetitive complexity of infinite words. - Jeremy Nicholson; Narad Rampersad (CoRR, 2015)

Binary Words Avoiding x xR x and Strongly Unimodal Sequences. - James D. Currie; Narad Rampersad (J. Integer Seq., 2015)

The Frobenius problem for the shuffle operation. - Jeremy Nicholson; Narad Rampersad (CoRR, 2016)

Initial non-repetitive complexity of infinite words. - Jeremy Nicholson; Narad Rampersad (Discret. Appl. Math., 2016)

Growth rate of binary words avoiding xxxR. - James D. Currie; Narad Rampersad (Theor. Comput. Sci., 2016)

Formulas with Reversal. - Narad Rampersad (CiE, 2017)

Overpals, Underlaps, and Underpals. - Aayush Rajasekaran; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2017)

Existential length universality. - Pawel Gawrychowski; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (CoRR, 2017)

A family of formulas with reversal of high avoidability index. - James D. Currie; Lucas Mol; Narad Rampersad (Int. J. Algebra Comput., 2017)

On avoidability of formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (RAIRO Theor. Informatics Appl., 2017)

Common factors in automatic and Sturmian sequences. - Narad Rampersad; Jeffrey O. Shallit (CoRR, 2018)

Permutation complexity of images of Sturmian words by marked morphisms. - Adam Borchert; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2018)

Cyclic Complexity of Some Infinite Words and Generalizations. - Colin Krawchuk; Narad Rampersad (Integers, 2018)

Improved Estimates for the Number of Privileged Words. - Jeremy Nicholson; Narad Rampersad (J. Integer Seq., 2018)

The Formal Inverse of the Period-Doubling Sequence. - Narad Rampersad; Manon Stipulanti (J. Integer Seq., 2018)

Avoidance bases for formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (Theor. Comput. Sci., 2018)

New Results on Pseudosquare Avoidance. - Tim Ng; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2019)

Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. - James D. Currie; Lucas Mol; Narad Rampersad (Electron. J. Comb., 2019)

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (CoRR, 2019)

Cobham's Theorem and Automaticity. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit; Manon Stipulanti (Int. J. Found. Comput. Sci., 2019)

Some further results on squarefree arithmetic progressions in infinite words. - James D. Currie; Tero Harju; Pascal Ochem; Narad Rampersad (Theor. Comput. Sci., 2019)

Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (Theor. Comput. Sci., 2019)

Critical exponents of infinite balanced words. - Narad Rampersad; Jeffrey O. Shallit; Élise Vandomme (Theor. Comput. Sci., 2019)

Existential Length Universality. - Pawel Gawrychowski; Martin Lange; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (STACS, 2020)

Extremal Overlap-Free and Extremal $ beta$-Free Binary Words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2020)

Extremal overlap-free and extremal β-free binary words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2020)

The repetition threshold for binary rich words. - James D. Currie; Lucas Mol; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2020)

The weak circular repetition threshold over large alphabets. - Lucas Mol; Narad Rampersad (RAIRO Theor. Informatics Appl., 2020)

The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. - James D. Currie; Lucas Mol; Narad Rampersad (J. Integer Seq., 2020)

Lengths of extremal square-free ternary words. - Lucas Mol; Narad Rampersad (Contributions Discret. Math., 2021)

Closed Ziv-Lempel factorization of the m-bonacci words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (CoRR, 2021)

Prefixes of the Fibonacci word that end with a cube. - Narad Rampersad (CoRR, 2021)

The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word. - Narad Rampersad (CoRR, 2021)

An Inequality for the Number of Periods in a Word. - Daniel Gabric; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2021)

Squarefree words with interior disposable factors. - Marko Milosevic; Narad Rampersad (Theor. Comput. Sci., 2021)

Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. - Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2022)

Complement Avoidance in Binary Words. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2022)

Closed Ziv-Lempel factorization of the m-bonacci words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (Theor. Comput. Sci., 2022)

Dyck Words, Pattern Avoidance, and Automatic Sequences. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2023)

Sums of products of binomial coefficients mod 2 and 2-regular sequences. - Narad Rampersad; Max Wiebe (CoRR, 2023)

A small morphism giving Abelian repetition threshold less than 2. - James D. Currie; Narad Rampersad (CoRR, 2023)

Antisquares and Critical Exponents. - Aseem R. Baranwal; James D. Currie; Lucas Mol; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2023)

Properties of a ternary infinite word. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2023)

The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. - James D. Currie; Narad Rampersad (Electron. J. Comb., 2024)

Repetition Threshold for Binary Automatic Sequences. - Jean-Paul Allouche; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2024)

A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2024)

Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. - James D. Currie; Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (SIAM J. Discret. Math., 2024)

Words Avoiding Half-Flips. - James D. Currie; Narad Rampersad (WORDS, 2025)

Purely Automatic Sequences with the Uniform Distribution Property. - Shuo Li; Narad Rampersad (WORDS, 2025)

Repetition Factorization of Automatic Sequences. - Narad Rampersad; Jeffrey O. Shallit; Xinhao Xu (Int. J. Found. Comput. Sci., 2025)

The analogue of overlap-freeness for the Fibonacci morphism. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2025)

Rudin-Shapiro Sums Via Automata Theory and Logic. - Narad Rampersad; Jeffrey O. Shallit (Theory Comput. Syst., 2025)

Low complexity binary words avoiding (5/2)+-powers. - Narad Rampersad; James D. Currie (CoRR, 2025)