The following pages link to Narad Rampersad (Q284844):
Displaying 50 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- Some properties of a Rudin-Shapiro-like sequence (Q477769) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- Further applications of a power series method for pattern avoidance (Q547794) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Binary words containing infinitely many overlaps (Q869996) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- Detecting patterns in finite regular and context-free languages (Q990125) (← links)
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) (Q1010692) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- The Frobenius problem for the shuffle operation (Q1640009) (← links)
- Avoidance bases for formulas with reversal (Q1643149) (← links)
- Overpals, underlaps, and underpals (Q1678334) (← links)
- On integer sequences whose first iterates are linear (Q1774140) (← links)
- The abelian complexity of the paperfolding word (Q1942045) (← links)
- Inverse star, borders, and palstars (Q1944913) (← links)
- Formulas with reversal (Q2011639) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton (Q2170788) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382) (← links)
- New results on pseudosquare avoidance (Q2333047) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- Extremal words in morphic subshifts (Q2436834) (← links)
- A note on abelian returns in rotation words (Q2437858) (← links)
- Words avoiding repetitions in arithmetic progressions (Q2474231) (← links)
- Avoiding approximate repetitions with respect to the longest common subsequence distance (Q2631171) (← links)
- Squarefree words with interior disposable factors (Q2658049) (← links)
- Prefixes of the Fibonacci word that end with a cube (Q2681077) (← links)
- Fife's theorem for \(\frac 73\)-powers (Q2789528) (← links)
- Non-constructive Methods for Avoiding Repetitions in Words (Q2849973) (← links)
- Suffix Conjugates for a Class of Morphic Subshifts (Q2849980) (← links)
- The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system (Q2855521) (← links)
- Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure (Q2893309) (← links)
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages (Q2893312) (← links)
- Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
