×
Author ID: rampersad.narad Recent zbMATH articles by "Rampersad, Narad"
Published as: Rampersad, Narad; Rampersad, N.
External Links: MGP · ORCID

Publications by Year

Citations contained in zbMATH Open

85 Publications have been cited 568 times in 386 Documents Cited by Year
A proof of Dejean’s conjecture. Zbl 1215.68192
Currie, James; Rampersad, Narad
48
2011
Enumeration and decidable properties of automatic sequences. Zbl 1282.68186
Charlier, Émilie; Rampersad, Narad; Shallit, Jeffrey
41
2012
The state complexity of \(L^{2}\) and \(L^k\). Zbl 1187.68298
Rampersad, Narad
25
2006
Periodicity, repetitions, and orbits of an automatic sequence. Zbl 1173.68044
Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey
24
2009
On NFAs where all states are final, initial, or both. Zbl 1194.68140
Kao, Jui-Yi; Rampersad, Narad; Shallit, Jeffrey
24
2009
The abelian complexity of the paperfolding word. Zbl 1260.05002
Madill, Blake; Rampersad, Narad
23
2013
Avoiding large squares in infinite binary words. Zbl 1099.68080
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-wei
19
2005
Dejean’s conjecture holds for \({n\geq 27}\). Zbl 1192.68497
Currie, James; Rampersad, Narad
18
2009
Dejean’s conjecture holds for \(n\geq 30\). Zbl 1173.68050
Currie, James; Rampersad, Narad
16
2009
Finding the growth rate of a regular or context-free language in polynomial time. Zbl 1206.68172
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey
16
2010
Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\). Zbl 1285.68128
Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan
12
2014
Recurrent words with constant abelian complexity. Zbl 1222.68126
Currie, James; Rampersad, Narad
11
2011
Detecting palindromes, patterns and borders in regular languages. Zbl 1192.68403
Anderson, Terry; Loftus, John; Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey
11
2009
The number of ternary words avoiding abelian cubes grows exponentially. Zbl 1101.68741
Aberkane, Ali; Currie, James D.; Rampersad, Narad
11
2004
Shuffling and unshuffling. Zbl 1394.68212
Henshall, Dane; Rampersad, Narad; Shallit, Jeffrey
11
2012
Words avoiding reversed subwords. Zbl 1081.68076
Rampersad, Narad; Shallit, Jeffrey
10
2005
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. Zbl 1279.68171
Rampersad, Narad; Shallit, Jeffrey; Xu, Zhi
10
2012
Critical exponents of infinite balanced words. Zbl 1446.68132
Rampersad, Narad; Shallit, Jeffrey; Vandomme, Élise
10
2019
Finding the growth rate of a regular of context-free language in polynomial time. Zbl 1161.68528
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey
9
2008
On the asymptotic abelian complexity of morphic words. Zbl 1371.68220
Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad
9
2014
Further applications of a power series method for pattern avoidance. Zbl 1219.68128
Rampersad, Narad
8
2011
A family of formulas with reversal of high avoidability index. Zbl 1378.68132
Currie, James; Mol, Lucas; Rampersad, Narad
8
2017
On the number of abelian bordered words (with an example of automatic theorem-proving). Zbl 1309.68162
Goč, Daniel; Rampersad, Narad; Rigo, Michel; Salimov, Pavel
8
2014
Growth rate of binary words avoiding \(xxx^{R}\). Zbl 1334.68170
Currie, James; Rampersad, Narad
7
2016
Fixed points avoiding abelian \(k\)-powers. Zbl 1298.68203
Currie, James D.; Rampersad, Narad
6
2012
Squares and overlaps in the Thue-Morse sequence and some variants. Zbl 1110.68117
Brown, Shandy; Rampersad, Narad; Shallit, Jeffrey; Vasiga, Troy
6
2006
Some further results on squarefree arithmetic progressions in infinite words. Zbl 1436.68276
Currie, James; Harju, Tero; Ochem, Pascal; Rampersad, Narad
6
2019
The repetition threshold for binary rich words. Zbl 1456.68135
Currie, James D.; Mol, Lucas; Rampersad, Narad
6
2020
Lengths of extremal square-free ternary words. Zbl 1467.68149
Mol, Lucas; Rampersad, Narad
6
2021
Inverse star, borders, and palstars. Zbl 1260.68212
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-Wei
6
2011
Binary words containing infinitely many overlaps. Zbl 1108.68094
Currie, James; Rampersad, Narad; Shallit, Jeffrey
5
2006
Words avoiding repetitions in arithmetic progressions. Zbl 1133.68066
Kao, Jui-Yi; Rampersad, Narad; Shallit, Jeffrey; Silva, Manuel
5
2008
Enumeration and decidable properties of automatic sequences. Zbl 1221.68122
Charlier, Émilie; Rampersad, Narad; Shallit, Jeffrey
5
2011
On integer sequences whose first iterates are linear. Zbl 1069.39026
Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey
5
2005
Finite automata, palindromes, powers, and patterns. Zbl 1156.68441
Anderson, Terry; Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey
5
2008
Some properties of a Rudin-Shapiro-like sequence. Zbl 1302.68227
Lafrance, Philip; Rampersad, Narad; Yee, Randy
5
2015
On the number of abelian bordered words. Zbl 1381.68237
Rampersad, Narad; Rigo, Michel; Salimov, Pavel
5
2013
Multi-dimensional sets recognizable in all abstract numeration systems. Zbl 1254.68132
Charlier, Émilie; Lacroix, Anne; Rampersad, Narad
4
2012
The growth function of \(S\)-recognizable sets. Zbl 1222.68100
Charlier, Émilie; Rampersad, Narad
4
2011
State complexity of unique rational operations. Zbl 1168.68029
Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey; Ravikumar, Bala
4
2009
Extremal words in morphic subshifts. Zbl 1296.68116
Currie, James D.; Rampersad, Narad; Saari, Kalle; Zamboni, Luca Q.
4
2014
The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system. Zbl 1273.11017
Charlier, Émilie; Rampersad, Narad; Rigo, Michel; Waxweiler, Lauent
4
2011
On the complexity of deciding avoidability of sets of partial words. Zbl 1208.68164
Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad
4
2010
Abelian primitive words. Zbl 1278.68237
Domaratzki, Michael; Rampersad, Narad
4
2012
Avoidance bases for formulas with reversal. Zbl 1395.68223
Currie, James D.; Mol, Lucas; Rampersad, Narad
4
2018
Infinite words containing squares at every position. Zbl 1184.68370
Currie, James; Rampersad, Narad
3
2010
On the complexity of deciding avoidability of sets of partial words. Zbl 1247.68126
Blakeley, Brandon; Blanchet-Sadri, Francine; Gunter, Josh; Rampersad, Narad
3
2009
There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\). Zbl 1211.05006
Currie, James; Rampersad, Narad
3
2009
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \). Zbl 1183.68439
Currie, James D.; Rampersad, Narad
3
2008
Repetitions in words. Zbl 1476.68222
Rampersad, Narad; Shallit, Jeffrey
3
2016
Avoiding approximate repetitions with respect to the longest common subsequence distance. Zbl 1362.68238
Camungol, Serina; Rampersad, Narad
3
2016
On patterns occurring in binary algebraic numbers. Zbl 1151.11036
Adamczewski, B.; Rampersad, N.
3
2008
Avoiding approximate squares. Zbl 1155.68068
Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
3
2008
Circular repetition thresholds on some small alphabets: last cases of Gorbunova’s conjecture. Zbl 1429.68202
Currie, James D.; Mol, Lucas; Rampersad, Narad
3
2019
The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\). Zbl 1442.68188
Currie, James D.; Mol, Lucas; Rampersad, Narad
3
2020
Decimations of languages and state complexity. Zbl 1168.68026
Krieger, Dalia; Miller, Avery; Rampersad, Narad; Ravikumar, Bala; Shallit, Jeffrey
2
2009
Improved estimates for the number of privileged words. Zbl 1387.68192
Nicholson, Jeremy; Rampersad, Narad
2
2018
Words avoiding \(\frac{7}{3}\)-powers and the Thue-Morse morphism. Zbl 1161.68708
Rampersad, Narad
2
2005
Avoiding approximate squares. Zbl 1202.68296
Krieger, Dalia; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
2
2007
Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure. Zbl 1267.68136
Lacroix, Anne; Rampersad, Narad; Rigo, Michel; Vandomme, Élise
2
2012
Binary words avoiding \(xx^Rx\) and strongly unimodal sequences. Zbl 1329.68194
Currie, James; Rampersad, Narad
2
2015
New results on pseudosquare avoidance. Zbl 1444.68154
Ng, Tim; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
2
2019
Cobham’s theorem and automaticity. Zbl 1427.11029
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon
2
2019
Extremal overlap-free and extremal \(\beta\)-free binary words. Zbl 1462.68151
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey
2
2020
Dyck words, pattern avoidance, and automatic sequences. Zbl 07716993
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey
2
2023
Rudin-Shapiro sums via automata theory and logic. Zbl 07716994
Rampersad, Narad; Shallit, Jeffrey
2
2023
Detecting patterns in finite regular and context-free languages. Zbl 1206.68181
Rampersad, Narad; Shallit, Jeffrey
2
2010
Cubefree words with many squares. Zbl 1280.68147
Currie, James; Rampersad, Narad
2
2010
A note on abelian returns in rotation words. Zbl 1295.68179
Rampersad, Narad; Rigo, Michel; Salimov, Pavel
2
2014
The formal inverse of the period-doubling sequence. Zbl 1412.68176
Rampersad, Narad; Stipulanti, Manon
2
2018
Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words. Zbl 1436.68281
Jahannia, Marieh; Mohammad-noori, Morteza; Rampersad, Narad; Stipulanti, Manon
2
2019
Abelian primitive words. Zbl 1221.68125
Domaratzki, Michael; Rampersad, Narad
1
2011
On the context-freeness of the set of words containing overlaps. Zbl 1184.68330
Rampersad, Narad
1
2007
On avoidability of formulas with reversal. Zbl 1390.68512
Currie, James D.; Mol, Lucas; Rampersad, Narad
1
2017
Avoiding large squares in inifinite binary words. (Extended abstract). Zbl 1040.68087
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-Wei
1
2003
Words avoiding \(\frac73\)-powers and the Thue-Morse morphism. Zbl 1117.68464
Rampersad, Narad
1
2004
Words with many palindrome pair factors. Zbl 1327.68181
Borchert, Adam; Rampersad, Narad
1
2015
Fife’s theorem for \(\frac 73\)-powers. Zbl 1331.68173
Rampersad, Narad; Shallit, Jeffrey; Shur, Arseny
1
2011
Initial non-repetitive complexity of infinite words. Zbl 1342.68262
Nicholson, Jeremy; Rampersad, Narad
1
2016
Extremal words in the shift orbit closure of a morphic sequence. Zbl 1381.68231
Currie, James D.; Rampersad, Narad; Saari, Kalle
1
2013
Suffix conjugates for a class of morphic subshifts (extended abstract). Zbl 1398.68306
Currie, James D.; Rampersad, Narad; Saari, Kalle
1
2013
Squarefree words with interior disposable factors. Zbl 1497.68406
Milosevic, Marko; Rampersad, Narad
1
2021
Existential length universality. Zbl 07650901
Gawrychowski, Paweł; Lange, Martin; Rampersad, Narad; Shallit, Jeffrey; Szykuła, Marek
1
2020
On highly repetitive and power free words. Zbl 1298.68207
Rampersad, Narad; Vaslet, Elise
1
2013
Permutation complexity of images of Sturmian words by marked morphisms. Zbl 1402.68144
Borchert, Adam; Rampersad, Narad
1
2018
Dyck words, pattern avoidance, and automatic sequences. Zbl 07716993
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey
2
2023
Rudin-Shapiro sums via automata theory and logic. Zbl 07716994
Rampersad, Narad; Shallit, Jeffrey
2
2023
Lengths of extremal square-free ternary words. Zbl 1467.68149
Mol, Lucas; Rampersad, Narad
6
2021
Squarefree words with interior disposable factors. Zbl 1497.68406
Milosevic, Marko; Rampersad, Narad
1
2021
The repetition threshold for binary rich words. Zbl 1456.68135
Currie, James D.; Mol, Lucas; Rampersad, Narad
6
2020
The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\). Zbl 1442.68188
Currie, James D.; Mol, Lucas; Rampersad, Narad
3
2020
Extremal overlap-free and extremal \(\beta\)-free binary words. Zbl 1462.68151
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey
2
2020
Existential length universality. Zbl 07650901
Gawrychowski, Paweł; Lange, Martin; Rampersad, Narad; Shallit, Jeffrey; Szykuła, Marek
1
2020
Critical exponents of infinite balanced words. Zbl 1446.68132
Rampersad, Narad; Shallit, Jeffrey; Vandomme, Élise
10
2019
Some further results on squarefree arithmetic progressions in infinite words. Zbl 1436.68276
Currie, James; Harju, Tero; Ochem, Pascal; Rampersad, Narad
6
2019
Circular repetition thresholds on some small alphabets: last cases of Gorbunova’s conjecture. Zbl 1429.68202
Currie, James D.; Mol, Lucas; Rampersad, Narad
3
2019
New results on pseudosquare avoidance. Zbl 1444.68154
Ng, Tim; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
2
2019
Cobham’s theorem and automaticity. Zbl 1427.11029
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon
2
2019
Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words. Zbl 1436.68281
Jahannia, Marieh; Mohammad-noori, Morteza; Rampersad, Narad; Stipulanti, Manon
2
2019
Avoidance bases for formulas with reversal. Zbl 1395.68223
Currie, James D.; Mol, Lucas; Rampersad, Narad
4
2018
Improved estimates for the number of privileged words. Zbl 1387.68192
Nicholson, Jeremy; Rampersad, Narad
2
2018
The formal inverse of the period-doubling sequence. Zbl 1412.68176
Rampersad, Narad; Stipulanti, Manon
2
2018
Permutation complexity of images of Sturmian words by marked morphisms. Zbl 1402.68144
Borchert, Adam; Rampersad, Narad
1
2018
A family of formulas with reversal of high avoidability index. Zbl 1378.68132
Currie, James; Mol, Lucas; Rampersad, Narad
8
2017
On avoidability of formulas with reversal. Zbl 1390.68512
Currie, James D.; Mol, Lucas; Rampersad, Narad
1
2017
Growth rate of binary words avoiding \(xxx^{R}\). Zbl 1334.68170
Currie, James; Rampersad, Narad
7
2016
Repetitions in words. Zbl 1476.68222
Rampersad, Narad; Shallit, Jeffrey
3
2016
Avoiding approximate repetitions with respect to the longest common subsequence distance. Zbl 1362.68238
Camungol, Serina; Rampersad, Narad
3
2016
Initial non-repetitive complexity of infinite words. Zbl 1342.68262
Nicholson, Jeremy; Rampersad, Narad
1
2016
Some properties of a Rudin-Shapiro-like sequence. Zbl 1302.68227
Lafrance, Philip; Rampersad, Narad; Yee, Randy
5
2015
Binary words avoiding \(xx^Rx\) and strongly unimodal sequences. Zbl 1329.68194
Currie, James; Rampersad, Narad
2
2015
Words with many palindrome pair factors. Zbl 1327.68181
Borchert, Adam; Rampersad, Narad
1
2015
Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\). Zbl 1285.68128
Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan
12
2014
On the asymptotic abelian complexity of morphic words. Zbl 1371.68220
Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad
9
2014
On the number of abelian bordered words (with an example of automatic theorem-proving). Zbl 1309.68162
Goč, Daniel; Rampersad, Narad; Rigo, Michel; Salimov, Pavel
8
2014
Extremal words in morphic subshifts. Zbl 1296.68116
Currie, James D.; Rampersad, Narad; Saari, Kalle; Zamboni, Luca Q.
4
2014
A note on abelian returns in rotation words. Zbl 1295.68179
Rampersad, Narad; Rigo, Michel; Salimov, Pavel
2
2014
The abelian complexity of the paperfolding word. Zbl 1260.05002
Madill, Blake; Rampersad, Narad
23
2013
On the number of abelian bordered words. Zbl 1381.68237
Rampersad, Narad; Rigo, Michel; Salimov, Pavel
5
2013
Extremal words in the shift orbit closure of a morphic sequence. Zbl 1381.68231
Currie, James D.; Rampersad, Narad; Saari, Kalle
1
2013
Suffix conjugates for a class of morphic subshifts (extended abstract). Zbl 1398.68306
Currie, James D.; Rampersad, Narad; Saari, Kalle
1
2013
On highly repetitive and power free words. Zbl 1298.68207
Rampersad, Narad; Vaslet, Elise
1
2013
Enumeration and decidable properties of automatic sequences. Zbl 1282.68186
Charlier, Émilie; Rampersad, Narad; Shallit, Jeffrey
41
2012
Shuffling and unshuffling. Zbl 1394.68212
Henshall, Dane; Rampersad, Narad; Shallit, Jeffrey
11
2012
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. Zbl 1279.68171
Rampersad, Narad; Shallit, Jeffrey; Xu, Zhi
10
2012
Fixed points avoiding abelian \(k\)-powers. Zbl 1298.68203
Currie, James D.; Rampersad, Narad
6
2012
Multi-dimensional sets recognizable in all abstract numeration systems. Zbl 1254.68132
Charlier, Émilie; Lacroix, Anne; Rampersad, Narad
4
2012
Abelian primitive words. Zbl 1278.68237
Domaratzki, Michael; Rampersad, Narad
4
2012
Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure. Zbl 1267.68136
Lacroix, Anne; Rampersad, Narad; Rigo, Michel; Vandomme, Élise
2
2012
A proof of Dejean’s conjecture. Zbl 1215.68192
Currie, James; Rampersad, Narad
48
2011
Recurrent words with constant abelian complexity. Zbl 1222.68126
Currie, James; Rampersad, Narad
11
2011
Further applications of a power series method for pattern avoidance. Zbl 1219.68128
Rampersad, Narad
8
2011
Inverse star, borders, and palstars. Zbl 1260.68212
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-Wei
6
2011
Enumeration and decidable properties of automatic sequences. Zbl 1221.68122
Charlier, Émilie; Rampersad, Narad; Shallit, Jeffrey
5
2011
The growth function of \(S\)-recognizable sets. Zbl 1222.68100
Charlier, Émilie; Rampersad, Narad
4
2011
The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system. Zbl 1273.11017
Charlier, Émilie; Rampersad, Narad; Rigo, Michel; Waxweiler, Lauent
4
2011
Abelian primitive words. Zbl 1221.68125
Domaratzki, Michael; Rampersad, Narad
1
2011
Fife’s theorem for \(\frac 73\)-powers. Zbl 1331.68173
Rampersad, Narad; Shallit, Jeffrey; Shur, Arseny
1
2011
Finding the growth rate of a regular or context-free language in polynomial time. Zbl 1206.68172
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey
16
2010
On the complexity of deciding avoidability of sets of partial words. Zbl 1208.68164
Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad
4
2010
Infinite words containing squares at every position. Zbl 1184.68370
Currie, James; Rampersad, Narad
3
2010
Detecting patterns in finite regular and context-free languages. Zbl 1206.68181
Rampersad, Narad; Shallit, Jeffrey
2
2010
Cubefree words with many squares. Zbl 1280.68147
Currie, James; Rampersad, Narad
2
2010
Periodicity, repetitions, and orbits of an automatic sequence. Zbl 1173.68044
Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey
24
2009
On NFAs where all states are final, initial, or both. Zbl 1194.68140
Kao, Jui-Yi; Rampersad, Narad; Shallit, Jeffrey
24
2009
Dejean’s conjecture holds for \({n\geq 27}\). Zbl 1192.68497
Currie, James; Rampersad, Narad
18
2009
Dejean’s conjecture holds for \(n\geq 30\). Zbl 1173.68050
Currie, James; Rampersad, Narad
16
2009
Detecting palindromes, patterns and borders in regular languages. Zbl 1192.68403
Anderson, Terry; Loftus, John; Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey
11
2009
State complexity of unique rational operations. Zbl 1168.68029
Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey; Ravikumar, Bala
4
2009
On the complexity of deciding avoidability of sets of partial words. Zbl 1247.68126
Blakeley, Brandon; Blanchet-Sadri, Francine; Gunter, Josh; Rampersad, Narad
3
2009
There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\). Zbl 1211.05006
Currie, James; Rampersad, Narad
3
2009
Decimations of languages and state complexity. Zbl 1168.68026
Krieger, Dalia; Miller, Avery; Rampersad, Narad; Ravikumar, Bala; Shallit, Jeffrey
2
2009
Finding the growth rate of a regular of context-free language in polynomial time. Zbl 1161.68528
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey
9
2008
Words avoiding repetitions in arithmetic progressions. Zbl 1133.68066
Kao, Jui-Yi; Rampersad, Narad; Shallit, Jeffrey; Silva, Manuel
5
2008
Finite automata, palindromes, powers, and patterns. Zbl 1156.68441
Anderson, Terry; Rampersad, Narad; Santean, Nicolae; Shallit, Jeffrey
5
2008
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \). Zbl 1183.68439
Currie, James D.; Rampersad, Narad
3
2008
On patterns occurring in binary algebraic numbers. Zbl 1151.11036
Adamczewski, B.; Rampersad, N.
3
2008
Avoiding approximate squares. Zbl 1155.68068
Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
3
2008
Avoiding approximate squares. Zbl 1202.68296
Krieger, Dalia; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey
2
2007
On the context-freeness of the set of words containing overlaps. Zbl 1184.68330
Rampersad, Narad
1
2007
The state complexity of \(L^{2}\) and \(L^k\). Zbl 1187.68298
Rampersad, Narad
25
2006
Squares and overlaps in the Thue-Morse sequence and some variants. Zbl 1110.68117
Brown, Shandy; Rampersad, Narad; Shallit, Jeffrey; Vasiga, Troy
6
2006
Binary words containing infinitely many overlaps. Zbl 1108.68094
Currie, James; Rampersad, Narad; Shallit, Jeffrey
5
2006
Avoiding large squares in infinite binary words. Zbl 1099.68080
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-wei
19
2005
Words avoiding reversed subwords. Zbl 1081.68076
Rampersad, Narad; Shallit, Jeffrey
10
2005
On integer sequences whose first iterates are linear. Zbl 1069.39026
Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey
5
2005
Words avoiding \(\frac{7}{3}\)-powers and the Thue-Morse morphism. Zbl 1161.68708
Rampersad, Narad
2
2005
The number of ternary words avoiding abelian cubes grows exponentially. Zbl 1101.68741
Aberkane, Ali; Currie, James D.; Rampersad, Narad
11
2004
Words avoiding \(\frac73\)-powers and the Thue-Morse morphism. Zbl 1117.68464
Rampersad, Narad
1
2004
Avoiding large squares in inifinite binary words. (Extended abstract). Zbl 1040.68087
Rampersad, Narad; Shallit, Jeffrey; Wang, Ming-Wei
1
2003
all top 5

Cited by 407 Authors

52 Shallit, Jeffrey Outlaw
37 Rampersad, Narad
22 Currie, James D.
15 Shur, Arseny M.
14 Blanchet-Sadri, Francine
14 Charlier, Emilie
13 Ochem, Pascal
13 Rigo, Michel
11 Mól, Lucas A. S.
11 Salomaa, Kai T.
10 Bell, Jason P.
10 Pelantová, Edita
10 Wen, Zhixiong
9 Harju, Tero
9 Puzynina, Svetlana
9 Rosenfeld, Matthieu
8 Chen, Jin
8 Dvořáková, L’ubomíra
8 Jirásková, Galina
8 Schaeffer, Luke
7 Allouche, Jean-Paul Simon
7 Badkobeh, Golnaz
7 Fici, Gabriele
7 Okhotin, Alexander
7 Stipulanti, Manon
7 Zamboni, Luca Quardo
6 Grytczuk, Jarosław
6 Kiefer, Stefan
6 Lü, Xiaotao
6 Mousavi, Hamoon
6 Rao, Michaël
5 Cisternino, Célia
5 Crochemore, Maxime
5 Goč, Daniel
5 Han, Yo-Sub
5 Holzer, Markus
5 Kutrib, Martin
5 Mercaş, Robert George
5 Rowland, Eric S.
5 Wu, Wen
4 Bašić, Bojan
4 Bell, Paul C.
4 Cassaigne, Julien
4 Diekert, Volker
4 Dolce, Francesco
4 Frid, Anna Èduardovna
4 Gabric, Daniel
4 Guo, Yingjun
4 Konieczny, Jakub
4 Manea, Florin
4 Salo, Ville O.
4 Vialette, Stéphane
4 Vyalyĭ, Mikhail Nikolaevich
4 Whiteland, Markus A.
4 Wolf, Petra
4 Yu, Sheng
3 Ago, Kristina
3 Byszewski, Jakub
3 Domaratzki, Michael
3 Du, Chen Fei
3 Gao, Yuan
3 Hospodár, Michal
3 Kari, Lila
3 Ko, Sang-Ki
3 Massuir, Adeline
3 Mignosi, Filippo
3 Müller, Mike
3 Nayar, Barbara
3 Petrova, Elena A.
3 Rubtsov, Alexander A.
3 Rukavicka, Josef
3 Saari, Kalle
3 Węsek, Krzysztof
3 Yassawi, Reem
2 Albayrak, Seda
2 Andrieu, Mélodie
2 Brzozowski, Janusz Antoni
2 Bulteau, Laurent
2 Chambart, Pierre
2 Chen, Kun
2 Chistikov, Dmitry V.
2 Dȩbski, Michał
2 Dekking, Frederik Michel
2 Dubickas, Artūras
2 Eom, Hae-Sung
2 Fazekas, Szilárd Zsolt
2 Fernau, Henning
2 Finkel, Alain
2 Fox, Nathan
2 Gorbunova, Irina A.
2 Grigore, Radu
2 Hadjicostis, Christoforos N.
2 Hawes, Kenneth
2 Henshall, Dane
2 Heuberger, Clemens
2 Karhumaki, Juhani
2 Kociumaka, Tomasz
2 Kopecki, Steffen
2 Krenn, Daniel
2 Kunc, Michal
...and 307 more Authors
all top 5

Cited in 68 Serials

83 Theoretical Computer Science
23 International Journal of Foundations of Computer Science
20 The Electronic Journal of Combinatorics
17 RAIRO. Theoretical Informatics and Applications
12 Advances in Applied Mathematics
11 Information and Computation
9 Discrete Mathematics
9 Information Processing Letters
7 Journal of Computer and System Sciences
6 Discrete Applied Mathematics
6 Journal of Combinatorial Theory. Series A
6 Theory of Computing Systems
4 Mathematics of Computation
4 European Journal of Combinatorics
4 SIAM Journal on Discrete Mathematics
4 International Journal of Algebra and Computation
4 Journal of Integer Sequences
4 Fundamenta Informaticae
4 Integers
3 Acta Informatica
3 Aequationes Mathematicae
3 Indagationes Mathematicae. New Series
3 Discrete Mathematics and Theoretical Computer Science. DMTCS
3 RAIRO. Theoretical Informatics and Applications
3 Logical Methods in Computer Science
3 Cryptography and Communications
2 Problems of Information Transmission
2 Canadian Journal of Mathematics
2 Journal of Algebra
2 Journal de Théorie des Nombres de Bordeaux
2 Annals of Combinatorics
2 Comptes Rendus. Mathématique. Académie des Sciences, Paris
2 Journal of Discrete Algorithms
2 Computer Science Review
2 Enumerative Combinatorics and Applications
2 Combinatorial Theory
1 Computers & Mathematics with Applications
1 Journal d’Analyse Mathématique
1 Journal of Mathematical Analysis and Applications
1 Chaos, Solitons and Fractals
1 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica
1 Information Sciences
1 Journal of Number Theory
1 Mathematische Zeitschrift
1 Proceedings of the American Mathematical Society
1 Semigroup Forum
1 Transactions of the American Mathematical Society
1 Ergodic Theory and Dynamical Systems
1 Systems & Control Letters
1 Combinatorica
1 Graphs and Combinatorics
1 Algorithmica
1 Random Structures & Algorithms
1 Discrete Event Dynamic Systems
1 International Journal of Computer Mathematics
1 Linear Algebra and its Applications
1 Expositiones Mathematicae
1 The Australasian Journal of Combinatorics
1 Turkish Journal of Mathematics
1 Journal of Automata, Languages and Combinatorics
1 Journal of the ACM
1 Journal of the Australian Mathematical Society
1 Journal of Applied Mathematics
1 Acta Mathematica Scientia. Series B. (English Edition)
1 International Journal of Number Theory
1 Contributions to Discrete Mathematics
1 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions
1 Proceedings of the American Mathematical Society. Series B

Citations by Year