default search action
Narad Rampersad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j71]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: 14 (2024) - [i67]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Repetition Threshold for Binary Automatic Sequences. CoRR abs/2406.06513 (2024) - 2023
- [j70]James D. Currie
, Pascal Ochem
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57: 1 (2023) - [c21]Lucas Mol
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS 2023: 220-232 - [c20]Narad Rampersad, Jeffrey O. Shallit:
Rudin-Shapiro Sums via Automata Theory and Logic. WORDS 2023: 233-246 - [i66]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR abs/2301.06145 (2023) - [i65]Narad Rampersad, Jeffrey O. Shallit:
Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR abs/2302.00405 (2023) - [i64]Narad Rampersad, Max Wiebe:
Sums of products of binomial coefficients mod 2 and 2-regular sequences. CoRR abs/2309.04012 (2023) - [i63]James D. Currie, Narad Rampersad:
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. CoRR abs/2310.07010 (2023) - [i62]James D. Currie, Narad Rampersad:
The analogue of overlap-freeness for the Fibonacci morphism. CoRR abs/2311.12962 (2023) - [i61]James D. Currie, Narad Rampersad:
A small morphism giving Abelian repetition threshold less than 2. CoRR abs/2312.16665 (2023) - 2022
- [j69]Narad Rampersad, Jeffrey O. Shallit:
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. 29(3) (2022) - [j68]Marieh Jahannia
Closed Ziv-Lempel factorization of the m-bonacci words. Theor. Comput. Sci. 918: 32-47 (2022) - [i60]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a Ternary Infinite Word. CoRR abs/2206.01776 (2022) - [i59]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. CoRR abs/2209.09223 (2022) - [i58]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Complement Avoidance in Binary Words. CoRR abs/2209.09598 (2022) - 2021
- [j67]Lucas Mol, Narad Rampersad:
Lengths of extremal square-free ternary words. Contributions Discret. Math. 16(1): 8-19 (2021) - [j66]Daniel Gabric
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32(5): 597-614 (2021) - [j65]Marko Milosevic, Narad Rampersad:
Squarefree words with interior disposable factors. Theor. Comput. Sci. 863: 120-126 (2021) - [i57]Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti
Closed Ziv-Lempel factorization of the m-bonacci words. CoRR abs/2106.03202 (2021) - [i56]Narad Rampersad, Jeffrey O. Shallit:
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR abs/2110.06244 (2021) - [i55]James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR abs/2111.07857 (2021) - [i54]Narad Rampersad:
Prefixes of the Fibonacci word that end with a cube. CoRR abs/2111.09253 (2021) - [i53]Narad Rampersad:
The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word. CoRR abs/2112.04416 (2021) - 2020
- [j64]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27(4): 4 (2020) - [j63]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j62]Lucas Mol, Narad Rampersad:
The weak circular repetition threshold over large alphabets. RAIRO Theor. Informatics Appl. 54: 6 (2020) - [j61]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): 20.3.1 (2020) - [c19]Pawel Gawrychowski
Existential Length Universality. STACS 2020: 16:1-16:14 - [i52]Lucas Mol, Narad Rampersad:
Lengths of extremal square-free ternary words. CoRR abs/2001.11763 (2020) - [i51]Daniel Gabric
An inequality for the number of periods in a word. CoRR abs/2005.11718 (2020) - [i50]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal overlap-free and extremal β-free binary words. CoRR abs/2006.10152 (2020) - [i49]Marko Milosevic, Narad Rampersad:
Squarefree words with interior disposable factors. CoRR abs/2007.03557 (2020)
2010 – 2019
- 2019
- [j60]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): 2 (2019) - [j59]Lucas Mol
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30(8): 1363-1379 (2019) - [j58]Narad Rampersad
Critical exponents of infinite balanced words. Theor. Comput. Sci. 777: 454-463 (2019) - [j57]Marieh Jahannia
Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words. Theor. Comput. Sci. 790: 16-40 (2019) - [j56]James D. Currie, Tero Harju
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799: 140-148 (2019) - [c18]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New Results on Pseudosquare Avoidance. WORDS 2019: 264-274 - [i48]James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. CoRR abs/1901.06351 (2019) - [i47]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New results on pseudosquare avoidance. CoRR abs/1904.09157 (2019) - [i46]Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti:
Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words. CoRR abs/1905.01340 (2019) - [i45]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. CoRR abs/1908.03169 (2019) - [i44]James D. Currie, Lucas Mol, Narad Rampersad:
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR abs/1911.05779 (2019) - [i43]Lucas Mol, Narad Rampersad:
The Weak Circular Repetition Threshold Over Large Alphabets. CoRR abs/1912.11388 (2019) - 2018
- [j55]Adam Borchert, Narad Rampersad:
Permutation complexity of images of Sturmian words by marked morphisms. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j54]Colin Krawchuk, Narad Rampersad:
Cyclic Complexity of Some Infinite Words and Generalizations. Integers 18A: A12 (2018) - [j53]Jeremy Nicholson, Narad Rampersad:
Improved Estimates for the Number of Privileged Words. J. Integer Seq. 21(3): 18.3.8 (2018) - [j52]Narad Rampersad, Manon Stipulanti:
The Formal Inverse of the Period-Doubling Sequence. J. Integer Seq. 21(9): 18.9.1 (2018) - [j51]James D. Currie, Lucas Mol
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738: 25-41 (2018) - [i42]Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme:
Critical exponents of infinite balanced words. CoRR abs/1801.05334 (2018) - [i41]Narad Rampersad, Jeffrey O. Shallit:
Common factors in automatic and Sturmian sequences. CoRR abs/1802.00325 (2018) - [i40]James D. Currie, Lucas Mol, Narad Rampersad:
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR abs/1803.08145 (2018) - [i39]Narad Rampersad, Manon Stipulanti
The Formal Inverse of the Period-Doubling Sequence. CoRR abs/1807.11899 (2018) - [i38]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. CoRR abs/1809.00679 (2018) - 2017
- [j50]James D. Currie, Lucas Mol
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5): 477-493 (2017) - [j49]James D. Currie, Lucas Mol
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51(4): 181-189 (2017) - [c17]Narad Rampersad:
Formulas with Reversal. CiE 2017: 98-100 - [c16]Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit:
Overpals, Underlaps, and Underpals. WORDS 2017: 17-29 - [i37]Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential length universality. CoRR abs/1702.03961 (2017) - [i36]Adam Borchert, Narad Rampersad:
Permutation complexity of images of Sturmian words by marked morphisms. CoRR abs/1710.08820 (2017) - 2016
- [j48]Jeremy Nicholson, Narad Rampersad
Initial non-repetitive complexity of infinite words. Discret. Appl. Math. 208: 114-122 (2016) - [j47]James D. Currie
Growth rate of binary words avoiding xxxR. Theor. Comput. Sci. 609: 456-468 (2016) - [i35]Jeremy Nicholson, Narad Rampersad:
The Frobenius problem for the shuffle operation. CoRR abs/1608.08592 (2016) - 2015
- [j46]Philip Lafrance
Some properties of a Rudin-Shapiro-like sequence. Adv. Appl. Math. 63: 19-40 (2015) - [j45]Adam Borchert, Narad Rampersad:
Words with many Palindrome Pair Factors. Electron. J. Comb. 22(4): 4 (2015) - [j44]James D. Currie, Narad Rampersad:
Binary Words Avoiding x xR x and Strongly Unimodal Sequences. J. Integer Seq. 18(10): 15.10.3 (2015) - [i34]James D. Currie, Narad Rampersad:
Growth rate of binary words avoiding xxxR. CoRR abs/1502.07014 (2015) - [i33]Jeremy Nicholson, Narad Rampersad:
Non-repetitive complexity of infinite words. CoRR abs/1507.08206 (2015) - [i32]James D. Currie, Narad Rampersad:
Binary words avoiding xx^Rx and strongly unimodal sequences. CoRR abs/1508.02964 (2015) - [i31]Adam Borchert, Narad Rampersad:
Words with many palindrome pair factors. CoRR abs/1509.05396 (2015) - 2014
- [j43]Francine Blanchet-Sadri, Nathan Fox
On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. 61: 46-84 (2014) - [j42]James D. Currie, Narad Rampersad
Extremal words in morphic subshifts. Discret. Math. 322: 53-60 (2014) - [j41]Daniel Goc, Narad Rampersad, Michel Rigo
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). Int. J. Found. Comput. Sci. 25(8): 1097-1110 (2014) - [j40]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: A11 (2014) - [j39]Narad Rampersad, Michel Rigo
A note on abelian returns in rotation words. Theor. Comput. Sci. 528: 101-107 (2014) - [i30]Philip Lafrance, Narad Rampersad, Randy Yee:
Some properties of a Rudin-Shapiro-like sequence. CoRR abs/1408.2277 (2014) - 2013
- [j38]Blake Madill, Narad Rampersad:
The abelian complexity of the paperfolding word. Discret. Math. 313(7): 831-838 (2013) - [j37]Anne Lacroix, Narad Rampersad:
Automaticity of Primitive Words and Irreducible Polynomials. Discret. Math. Theor. Comput. Sci. 15(1): 29-36 (2013) - [c15]Narad Rampersad:
Non-constructive Methods for Avoiding Repetitions in Words. WORDS 2013: 15-17 - [c14]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS 2013: 95-106 - [c13]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory 2013: 143-154 - [c12]Narad Rampersad, Michel Rigo
On the Number of Abelian Bordered Words. Developments in Language Theory 2013: 420-432 - [i29]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal words in the shift orbit closure of a morphic sequence. CoRR abs/1301.4972 (2013) - [i28]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix conjugates for a class of morphic subshifts. CoRR abs/1307.5329 (2013) - 2012
- [j36]Dane Henshall, Narad Rampersad, Jeffrey O. Shallit:
Shuffling and Unshuffling. Bull. EATCS 107: 131-142 (2012) - [j35]Anne Lacroix, Narad Rampersad, Michel Rigo
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae 116(1-4): 175-187 (2012) - [j34]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): 223-236 (2012) - [j33]Michael Domaratzki
Abelian Primitive Words. Int. J. Found. Comput. Sci. 23(5): 1021-1034 (2012) - [j32]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23(5): 1035-1066 (2012) - [j31]Emilie Charlier, Anne Lacroix, Narad Rampersad:
Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO Theor. Informatics Appl. 46(1): 51-65 (2012) - [j30]James D. Currie, Narad Rampersad:
Fixed points avoiding Abelian k-powers. J. Comb. Theory A 119(5): 942-948 (2012) - [i27]Blake Madill, Narad Rampersad:
The abelian complexity of the paperfolding word. CoRR abs/1208.2856 (2012) - 2011
- [j29]James D. Currie, Narad Rampersad:
Recurrent words with constant Abelian complexity. Adv. Appl. Math. 47(1): 116-124 (2011) - [j28]Narad Rampersad:
Further Applications of a Power Series Method for Pattern Avoidance. Electron. J. Comb. 18(1) (2011) - [j27]Émilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
The Minimal Automaton Recognizing mN in a Linear Numeration System. Integers 11B: A4 (2011) - [j26]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse star, borders, and palstars. Inf. Process. Lett. 111(9): 420-422 (2011) - [j25]James D. Currie, Narad Rampersad:
A proof of Dejean's conjecture. Math. Comput. 80(274): 1063-1070 (2011) - [j24]Emilie Charlier, Narad Rampersad:
The growth function of S-recognizable sets. Theor. Comput. Sci. 412(39): 5400-5408 (2011) - [c11]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory 2011: 165-179 - [c10]Michael Domaratzki
Abelian Primitive Words. Developments in Language Theory 2011: 204-215 - [c9]Narad Rampersad, Elise Vaslet:
On Highly Repetitive and Power Free Words. Developments in Language Theory 2011: 441-451 - [c8]Narad Rampersad:
Abstract Numeration Systems. LATA 2011: 65-79 - [c7]Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur:
Fife's Theorem for (7/3)-Powers. WORDS 2011: 189-198 - [i26]Emilie Charlier, Narad Rampersad:
The growth function of S-recognizable sets. CoRR abs/1101.0036 (2011) - [i25]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. CoRR abs/1102.3698 (2011) - [i24]James D. Currie, Narad Rampersad:
Fixed points avoiding Abelian $k$-powers. CoRR abs/1106.1842 (2011) - [i23]Narad Rampersad, Jeffrey O. Shallit:
Shuffling and Unshuffling. CoRR abs/1106.5767 (2011) - 2010
- [j23]James D. Currie, Narad Rampersad:
Cubefree words with many squares. Discret. Math. Theor. Comput. Sci. 12(3): 29-34 (2010) - [j22]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. 21(4): 597-618 (2010) - [j21]Narad Rampersad, Jeffrey O. Shallit:
Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. 110(3): 108-112 (2010) - [j20]James D. Currie, Narad Rampersad:
Infinite words containing squares at every position. RAIRO Theor. Informatics Appl. 44(1): 113-124 (2010) - [j19]Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. 411(49): 4263-4271 (2010) - [c6]Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
State Complexity of Testing Divisibility. DCFS 2010: 48-57 - [i22]Michael Domaratzki, Narad Rampersad:
Abelian Primitive Words. CoRR abs/1006.4104 (2010) - [i21]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse Star, Borders, and Palstars. CoRR abs/1008.2440 (2010) - [i20]Emilie Charlier, Anne Lacroix, Narad Rampersad:
Multi-dimensional sets recognizable in all abstract numeration systems. CoRR abs/1010.5391 (2010)
2000 – 2009
- 2009
- [j18]James D. Currie, Narad Rampersad:
There are k-uniform cubefree binary morphisms for all k>=0. Discret. Appl. Math. 157(11): 2548-2551 (2009) - [j17]Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11): 1096-1118 (2009) - [j16]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for $\sf {N\ge 27}$. RAIRO Theor. Informatics Appl. 43(4): 775-778 (2009) - [j15]Dalia Krieger, Avery Miller
Decimations of languages and state complexity. Theor. Comput. Sci. 410(24-25): 2401-2409 (2009) - [j14]Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar:
State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009) - [j13]Jean-Paul Allouche
Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009) - [j12]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410(30-32): 2885-2888 (2009) - [j11]Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit:
On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(47-49): 5010-5021 (2009) - [c5]Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory 2009: 113-124 - [i19]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n>=27. CoRR abs/0901.3188 (2009) - [i18]James D. Currie, Narad Rampersad:
A proof of Dejean's conjecture. CoRR abs/0905.1129 (2009) - [i17]Narad Rampersad, Jeffrey O. Shallit:
Detecting patterns in finite regular and context-free languages. CoRR abs/0906.3220 (2009) - [i16]Narad Rampersad, Jeffrey O. Shallit, Zhi Xu:
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. CoRR abs/0907.0159 (2009) - [i15]Narad Rampersad:
Further applications of a power series method for pattern avoidance. CoRR abs/0907.4667 (2009) - [i14]Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey O. Shallit:
Automata and Reduced Words in the Free Group. CoRR abs/0910.4555 (2009) - 2008
- [j10]James D. Currie, Narad Rampersad:
For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electron. J. Comb. 15(1) (2008) - [j9]Narad Rampersad:
Avoiding Sufficiently Large Binary Patterns. Bull. EATCS 95: 241-245 (2008) - [j8]Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008) - [j7]Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit, Manuel Silva
Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008) - [c4]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory 2008: 339-358 - [c3]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63 - [i13]James D. Currie, Narad Rampersad:
For each $α$ > 2 there is an infinite binary word with critical exponent $α$. CoRR abs/0802.4095 (2008) - [i12]James D. Currie, Narad Rampersad:
Infinite words containing squares at every position. CoRR abs/0803.1189 (2008) - [i11]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n >= 30. CoRR abs/0806.0043 (2008) - [i10]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Periodicity, repetitions, and orbits of an automatic sequence. CoRR abs/0808.1657 (2008) - [i9]Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey O. Shallit:
On NFAs Where All States are Final, Initial, or Both. CoRR abs/0808.2417 (2008) - [i8]James D. Currie, Narad Rampersad:
Cubefree words with many squares. CoRR abs/0811.3233 (2008) - [i7]James D. Currie, Narad Rampersad:
There are k-uniform cubefree binary morphisms for all k >= 0. CoRR abs/0812.4470 (2008) - 2007
- [j6]Narad Rampersad:
On the context-freeness of the set of words containing overlaps. Inf. Process. Lett. 102(2-3): 74-78 (2007) - [c2]Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289 - [i6]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite automata, palindromes, patterns, and borders. CoRR abs/0711.3183 (2007) - [i5]Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the growth rate of a regular language in polynomial time. CoRR abs/0711.4990 (2007) - 2006
- [j5]James D. Currie, Narad Rampersad, Jeffrey O. Shallit:
Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. 13(1) (2006) - [j4]Narad Rampersad:
The state complexity of L2 and Lk. Inf. Process. Lett. 98(6): 231-234 (2006) - [j3]Shandy Brown, Narad Rampersad, Jeffrey O. Shallit, Troy Vasiga:
Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Theor. Informatics Appl. 40(3): 473-484 (2006) - [i4]Narad Rampersad:
On the context-freeness of the set of words containing overlaps. CoRR abs/math/0610067 (2006) - 2005
- [j2]Narad Rampersad:
Words avoiding 7/3-powers and the thue-morse morphism. Int. J. Found. Comput. Sci. 16(4): 755-766 (2005) - [j1]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005) - 2004
- [c1]Narad Rampersad:
Words Avoiding 7/3-Powers and the Thue-Morse Morphism. Developments in Language Theory 2004: 357-367 - [i3]Narad Rampersad:
The state complexity of L2 and Lk. CoRR cs.CC/0410032 (2004) - 2003
- [i2]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Cubefree binary words avoiding long squares. CoRR math.CO/0302303 (2003) - [i1]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. CoRR math.CO/0306081 (2003)
Coauthor Index
[i67] [j70] [c21] [c20] [i66] [i65] [j69] [i60] [i59] [i58] [j66] [i56] [i55] [j64] [c19] [i51] [i50] [j59] [j58] [c18] [i47] [i42] [i41] [i38] [c16] [i37] [j36] [j34] [j32] [j26] [c11] [c7] [i25] [i23] [j22] [j21] [i21] [j17] [j15] [j14] [j13] [j11] [i17] [i16] [i14] [j8] [j7] [c4] [c3] [i10] [i9] [c2] [i6] [i5] [j5] [j3] [j1] [i2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 19:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: