Narad Rampersad

173 papers A 1C 12Journal 150Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Complexity of Linear Subsequences of Fibonacci-Automatic Sequences. CoRR Delaram Moradi, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Complement Avoidance in Binary Words. Electron. J. Comb. James D. Currie, L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Complexity of Linear Subsequences of CoRR Delaram Moradi, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Low complexity binary words avoiding $(5/2)^+$-powers. Discret. Math. Theor. Comput. Sci. James D. Currie, Narad Rampersad
2025	J	`jnl`	Low complexity binary words avoiding (5/2) CoRR Narad Rampersad, James D. Currie
2025	—	`conf`	Purely Automatic Sequences with the Uniform Distribution Property. WORDS Shuo Li, Narad Rampersad
2025	J	`jnl`	Reduced complexities for sequences over finite alphabets. CoRR John M. Campbell, James D. Currie, Narad Rampersad
2025	J	`jnl`	Repetition Factorization of Automatic Sequences. Int. J. Found. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Xinhao Xu
2025	J	`jnl`	Rudin-Shapiro Sums Via Automata Theory and Logic. Theory Comput. Syst. Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	The analogue of overlap-freeness for the Fibonacci morphism. RAIRO Theor. Informatics Appl. James D. Currie, Narad Rampersad
2025	—	`conf`	Words Avoiding Half-Flips. WORDS James D. Currie, Narad Rampersad
2024	J	`jnl`	A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. RAIRO Theor. Informatics Appl. James D. Currie, Narad Rampersad
2024	J	`jnl`	Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. SIAM J. Discret. Math. James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2024	J	`jnl`	Repetition Threshold for Binary Automatic Sequences. CoRR Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2024	J	`jnl`	The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. Electron. J. Comb. James D. Currie, Narad Rampersad
2023	J	`jnl`	A small morphism giving Abelian repetition threshold less than 2. CoRR James D. Currie, Narad Rampersad
2023	J	`jnl`	Antisquares and Critical Exponents. Discret. Math. Theor. Comput. Sci. Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	—	`conf`	Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR Narad Rampersad, Jeffrey O. Shallit
2023	—	`conf`	Rudin-Shapiro Sums via Automata Theory and Logic. WORDS Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Sums of products of binomial coefficients mod 2 and 2-regular sequences. CoRR Narad Rampersad, Max Wiebe
2023	J	`jnl`	The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. CoRR James D. Currie, Narad Rampersad
2023	J	`jnl`	The analogue of overlap-freeness for the Fibonacci morphism. CoRR James D. Currie, Narad Rampersad
2022	J	`jnl`	Antisquares and Critical Exponents. CoRR Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Closed Ziv-Lempel factorization of the Theor. Comput. Sci. Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
2022	J	`jnl`	Complement Avoidance in Binary Words. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Properties of a Ternary Infinite Word. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Closed Ziv-Lempel factorization of the m-bonacci words. CoRR Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
2021	J	`jnl`	Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Lengths of extremal square-free ternary words. Contributions Discret. Math. Lucas Mol, Narad Rampersad
2021	J	`jnl`	Prefixes of the Fibonacci word that end with a cube. CoRR Narad Rampersad
2021	J	`jnl`	Squarefree words with interior disposable factors. Theor. Comput. Sci. Marko Milosevic, Narad Rampersad
2021	J	`jnl`	The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word. CoRR Narad Rampersad
2020	J	`jnl`	An inequality for the number of periods in a word. CoRR Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
2020	A	`conf`	Existential Length Universality. STACS Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
2020	J	`jnl`	Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020	J	`jnl`	Extremal overlap-free and extremal β-free binary words. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020	J	`jnl`	Lengths of extremal square-free ternary words. CoRR Lucas Mol, Narad Rampersad
2020	J	`jnl`	Squarefree words with interior disposable factors. CoRR Marko Milosevic, Narad Rampersad
2020	J	`jnl`	The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. James D. Currie, Lucas Mol, Narad Rampersad
2020	J	`jnl`	The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. James D. Currie, Lucas Mol, Narad Rampersad
2020	J	`jnl`	The weak circular repetition threshold over large alphabets. RAIRO Theor. Informatics Appl. Lucas Mol, Narad Rampersad
2019	J	`jnl`	Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. James D. Currie, Lucas Mol, Narad Rampersad
2019	J	`jnl`	Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2019	J	`jnl`	Critical exponents of infinite balanced words. Theor. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
2019	—	`conf`	New Results on Pseudosquare Avoidance. WORDS Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	J	`jnl`	New results on pseudosquare avoidance. CoRR Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	J	`jnl`	Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words. CoRR Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
2019	J	`jnl`	Palindromic Ziv-Lempel and Crochemore factorizations of Theor. Comput. Sci. Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
2019	J	`jnl`	Some further results on squarefree arithmetic progressions in infinite words. CoRR James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019	J	`jnl`	Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019	J	`jnl`	The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR James D. Currie, Lucas Mol, Narad Rampersad
2019	J	`jnl`	The Weak Circular Repetition Threshold Over Large Alphabets. CoRR Lucas Mol, Narad Rampersad
2019	J	`jnl`	The repetition threshold for binary rich words. CoRR James D. Currie, Lucas Mol, Narad Rampersad
2018	J	`jnl`	Avoidance bases for formulas with reversal. Theor. Comput. Sci. James D. Currie, Lucas Mol, Narad Rampersad
2018	J	`jnl`	Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR James D. Currie, Lucas Mol, Narad Rampersad
2018	J	`jnl`	Cobham's Theorem and Automaticity. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2018	J	`jnl`	Common factors in automatic and Sturmian sequences. CoRR Narad Rampersad, Jeffrey O. Shallit
2018	J	`jnl`	Critical exponents of infinite balanced words. CoRR Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
2018	J	`jnl`	Cyclic Complexity of Some Infinite Words and Generalizations. Integers Colin Krawchuk, Narad Rampersad
2018	J	`jnl`	Improved Estimates for the Number of Privileged Words. J. Integer Seq. Jeremy Nicholson, Narad Rampersad
2018	J	`jnl`	Permutation complexity of images of Sturmian words by marked morphisms. Discret. Math. Theor. Comput. Sci. Adam Borchert, Narad Rampersad
2018	J	`jnl`	The Formal Inverse of the Period-Doubling Sequence. CoRR Narad Rampersad, Manon Stipulanti
2018	J	`jnl`	The Formal Inverse of the Period-Doubling Sequence. J. Integer Seq. Narad Rampersad, Manon Stipulanti
2017	J	`jnl`	A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. James D. Currie, Lucas Mol, Narad Rampersad
2017	J	`jnl`	Existential length universality. CoRR Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
2017	C	`conf`	Formulas with Reversal. CiE Narad Rampersad
2017	J	`jnl`	On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. James D. Currie, Lucas Mol, Narad Rampersad
2017	—	`conf`	Overpals, Underlaps, and Underpals. WORDS Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit
2017	J	`jnl`	Permutation complexity of images of Sturmian words by marked morphisms. CoRR Adam Borchert, Narad Rampersad
2016	J	`jnl`	Growth rate of binary words avoiding xxx Theor. Comput. Sci. James D. Currie, Narad Rampersad
2016	J	`jnl`	Initial non-repetitive complexity of infinite words. Discret. Appl. Math. Jeremy Nicholson, Narad Rampersad
2016	J	`jnl`	The Frobenius problem for the shuffle operation. CoRR Jeremy Nicholson, Narad Rampersad
2015	J	`jnl`	Binary Words Avoiding x xR x and Strongly Unimodal Sequences. J. Integer Seq. James D. Currie, Narad Rampersad
2015	J	`jnl`	Binary words avoiding xx^Rx and strongly unimodal sequences. CoRR James D. Currie, Narad Rampersad
2015	J	`jnl`	Growth rate of binary words avoiding xxx CoRR James D. Currie, Narad Rampersad
2015	J	`jnl`	Non-repetitive complexity of infinite words. CoRR Jeremy Nicholson, Narad Rampersad
2015	J	`jnl`	Some properties of a Rudin-Shapiro-like sequence. Adv. Appl. Math. Philip Lafrance, Narad Rampersad, Randy Yee
2015	J	`jnl`	Words with many Palindrome Pair Factors. Electron. J. Comb. Adam Borchert, Narad Rampersad
2015	J	`jnl`	Words with many palindrome pair factors. CoRR Adam Borchert, Narad Rampersad
2014	J	`jnl`	A note on abelian returns in rotation words. Theor. Comput. Sci. Narad Rampersad, Michel Rigo, Pavel Salimov
2014	J	`jnl`	Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
2014	J	`jnl`	Extremal words in morphic subshifts. Discret. Math. James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
2014	J	`jnl`	On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. Francine Blanchet-Sadri, Nathan Fox, Narad Rampersad
2014	J	`jnl`	On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). Int. J. Found. Comput. Sci. Daniel Goc, Narad Rampersad, Michel Rigo, Pavel Salimov
2014	J	`jnl`	Some properties of a Rudin-Shapiro-like sequence. CoRR Philip Lafrance, Narad Rampersad, Randy Yee
2013	J	`jnl`	Automaticity of Primitive Words and Irreducible Polynomials. Discret. Math. Theor. Comput. Sci. Anne Lacroix, Narad Rampersad
2013	C	`conf`	Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory James D. Currie, Narad Rampersad, Kalle Saari
2013	J	`jnl`	Extremal words in the shift orbit closure of a morphic sequence CoRR James D. Currie, Narad Rampersad, Kalle Saari
2013	—	`conf`	Non-constructive Methods for Avoiding Repetitions in Words. WORDS Narad Rampersad
2013	C	`conf`	On the Number of Abelian Bordered Words. Developments in Language Theory Narad Rampersad, Michel Rigo, Pavel Salimov
2013	—	`conf`	Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS James D. Currie, Narad Rampersad, Kalle Saari
2013	J	`jnl`	Suffix conjugates for a class of morphic subshifts. CoRR James D. Currie, Narad Rampersad, Kalle Saari
2013	J	`jnl`	The abelian complexity of the paperfolding word. Discret. Math. Blake Madill, Narad Rampersad
2012	J	`jnl`	Abelian Primitive Words. Int. J. Found. Comput. Sci. Michael Domaratzki, Narad Rampersad
2012	J	`jnl`	Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2012	J	`jnl`	Fixed points avoiding Abelian k-powers. J. Comb. Theory A James D. Currie, Narad Rampersad
2012	J	`jnl`	Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO Theor. Informatics Appl. Emilie Charlier, Anne Lacroix, Narad Rampersad
2012	J	`jnl`	Shuffling and Unshuffling. Bull. EATCS Dane Henshall, Narad Rampersad, Jeffrey O. Shallit
2012	J	`jnl`	Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme
2012	J	`jnl`	The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae Narad Rampersad, Jeffrey O. Shallit, Zhi Xu
2012	J	`jnl`	The abelian complexity of the paperfolding word CoRR Blake Madill, Narad Rampersad
2011	J	`jnl`	A proof of Dejean's conjecture. Math. Comput. James D. Currie, Narad Rampersad
2011	C	`conf`	Abelian Primitive Words. Developments in Language Theory Michael Domaratzki, Narad Rampersad
2011	C	`conf`	Abstract Numeration Systems. LATA Narad Rampersad
2011	J	`jnl`	Enumeration and Decidable Properties of Automatic Sequences CoRR Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2011	C	`conf`	Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2011	—	`conf`	Fife's Theorem for (7/3)-Powers WORDS Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur
2011	J	`jnl`	Fixed points avoiding Abelian $k$-powers CoRR James D. Currie, Narad Rampersad
2011	J	`jnl`	Further Applications of a Power Series Method for Pattern Avoidance. Electron. J. Comb. Narad Rampersad
2011	J	`jnl`	Inverse star, borders, and palstars. Inf. Process. Lett. Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2011	C	`conf`	On Highly Repetitive and Power Free Words. Developments in Language Theory Narad Rampersad, Elise Vaslet
2011	J	`jnl`	Recurrent words with constant Abelian complexity. Adv. Appl. Math. James D. Currie, Narad Rampersad
2011	J	`jnl`	Shuffling and Unshuffling CoRR Narad Rampersad, Jeffrey O. Shallit
2011	J	`jnl`	The Minimal Automaton Recognizing mN in a Linear Numeration System. Integers Émilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler
2011	J	`jnl`	The growth function of S-recognizable sets CoRR Emilie Charlier, Narad Rampersad
2011	J	`jnl`	The growth function of S-recognizable sets. Theor. Comput. Sci. Emilie Charlier, Narad Rampersad
2010	J	`jnl`	Abelian Primitive Words CoRR Michael Domaratzki, Narad Rampersad
2010	J	`jnl`	Cubefree words with many squares. Discret. Math. Theor. Comput. Sci. James D. Currie, Narad Rampersad
2010	J	`jnl`	Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. Narad Rampersad, Jeffrey O. Shallit
2010	J	`jnl`	Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2010	J	`jnl`	Infinite words containing squares at every position. RAIRO Theor. Informatics Appl. James D. Currie, Narad Rampersad
2010	J	`jnl`	Inverse Star, Borders, and Palstars CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2010	J	`jnl`	Multi-dimensional sets recognizable in all abstract numeration systems CoRR Emilie Charlier, Anne Lacroix, Narad Rampersad
2010	J	`jnl`	On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
2010	—	`conf`	State Complexity of Testing Divisibility DCFS Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler
2009	J	`jnl`	A proof of Dejean's conjecture CoRR James D. Currie, Narad Rampersad
2009	J	`jnl`	Automata and Reduced Words in the Free Group CoRR Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	Decimations of languages and state complexity. Theor. Comput. Sci. Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit
2009	J	`jnl`	Dejean's conjecture holds for $\sf {N\ge 27}$. RAIRO Theor. Informatics Appl. James D. Currie, Narad Rampersad
2009	J	`jnl`	Dejean's conjecture holds for n>=27. CoRR James D. Currie, Narad Rampersad
2009	J	`jnl`	Dejean's conjecture holds for n>=30. Theor. Comput. Sci. James D. Currie, Narad Rampersad
2009	J	`jnl`	Detecting palindromes, patterns and borders in regular languages. Inf. Comput. Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2009	J	`jnl`	Detecting patterns in finite regular and context-free languages CoRR Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	Further applications of a power series method for pattern avoidance CoRR Narad Rampersad
2009	J	`jnl`	On NFAs where all states are final, initial, or both. Theor. Comput. Sci. Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit
2009	C	`conf`	On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
2009	J	`jnl`	Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	State complexity of unique rational operations. Theor. Comput. Sci. Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar
2009	J	`jnl`	The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages CoRR Narad Rampersad, Jeffrey O. Shallit, Zhi Xu
2009	J	`jnl`	There are k-uniform cubefree binary morphisms for all k>=0. Discret. Appl. Math. James D. Currie, Narad Rampersad
2008	J	`jnl`	Avoiding Approximate Squares. Int. J. Found. Comput. Sci. Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	Avoiding Sufficiently Large Binary Patterns. Bull. EATCS Narad Rampersad
2008	J	`jnl`	Cubefree words with many squares. CoRR James D. Currie, Narad Rampersad
2008	J	`jnl`	Dejean's conjecture holds for n >= 30. CoRR James D. Currie, Narad Rampersad
2008	C	`conf`	Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2008	C	`conf`	Finite Automata, Palindromes, Powers, and Patterns. LATA Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2008	J	`jnl`	For each $α$ > 2 there is an infinite binary word with critical exponent $α$. CoRR James D. Currie, Narad Rampersad
2008	J	`jnl`	For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electron. J. Comb. James D. Currie, Narad Rampersad
2008	J	`jnl`	Infinite words containing squares at every position. CoRR James D. Currie, Narad Rampersad
2008	J	`jnl`	On NFAs Where All States are Final, Initial, or Both CoRR Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	Periodicity, repetitions, and orbits of an automatic sequence CoRR Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	There are k-uniform cubefree binary morphisms for all k >= 0. CoRR James D. Currie, Narad Rampersad
2008	J	`jnl`	Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit, Manuel Silva
2007	C	`conf`	Avoiding Approximate Squares. Developments in Language Theory Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2007	J	`jnl`	Finding the growth rate of a regular language in polynomial time CoRR Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2007	J	`jnl`	Finite automata, palindromes, patterns, and borders CoRR Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2007	J	`jnl`	On the context-freeness of the set of words containing overlaps. Inf. Process. Lett. Narad Rampersad
2006	J	`jnl`	Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. James D. Currie, Narad Rampersad, Jeffrey O. Shallit
2006	J	`jnl`	On the context-freeness of the set of words containing overlaps. CoRR Narad Rampersad
2006	J	`jnl`	Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Theor. Informatics Appl. Shandy Brown, Narad Rampersad, Jeffrey O. Shallit, Troy Vasiga
2006	J	`jnl`	The state complexity of L Inf. Process. Lett. Narad Rampersad
2005	J	`jnl`	Avoiding large squares in infinite binary words. Theor. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2005	J	`jnl`	Words avoiding 7/3-powers and the thue-morse morphism. Int. J. Found. Comput. Sci. Narad Rampersad
2004	J	`jnl`	The state complexity of L CoRR Narad Rampersad
2004	C	`conf`	Words Avoiding 7/3-Powers and the Thue-Morse Morphism. Developments in Language Theory Narad Rampersad
2003	J	`jnl`	Avoiding large squares in infinite binary words CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2003	J	`jnl`	Cubefree binary words avoiding long squares CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang