The following pages link to Narad Rampersad (Q284844):
Displaying 50 items.
- Suffix conjugates for a class of morphic subshifts (Q2942567) (← links)
- Abstract Numeration Systems (Q3004567) (← links)
- (Q3024004) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- (Q3396643) (← links)
- Squares and overlaps in the Thue-Morse sequence and some variants (Q3421909) (← links)
- Binary words avoiding xx^Rx and strongly unimodal sequences (Q3457636) (← links)
- On patterns occurring in binary algebraic numbers (Q3522307) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
- (Q4453455) (← links)
- Permutation complexity of images of Sturmian words by marked morphisms (Q4560244) (← links)
- (Q4584890) (← links)
- The Formal Inverse of the Period-Doubling Sequence (Q4612104) (← links)
- On avoidability of formulas with reversal (Q4638263) (← links)
- Improved estimates for the number of privileged words (Q4639881) (← links)
- ABELIAN PRIMITIVE WORDS (Q4902891) (← links)
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892) (← links)
- (Q4964009) (← links)
- Lengths of extremal square-free ternary words. (Q4986268) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- The repetition threshold for binary rich words (Q5130737) (← links)
- Infinite words containing squares at every position (Q5190080) (← links)
- Enumeration and Decidable Properties of Automatic Sequences (Q5199962) (← links)
- Abelian Primitive Words (Q5199965) (← links)
- On Highly Repetitive and Power Free Words (Q5199988) (← links)
- Cobham’s Theorem and Automaticity (Q5207238) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- Extremal Words in the Shift Orbit Closure of a Morphic Sequence (Q5300836) (← links)
- On the Number of Abelian Bordered Words (Q5300859) (← links)
- A family of formulas with reversal of high avoidability index (Q5365323) (← links)
- Repetitions in words (Q5365560) (← links)
- (Q5384332) (← links)
- Cubefree words with many squares (Q5396734) (← links)
- On highly repetitive and power free words (Q5404287) (← links)
- Concerning Kurosaki's squarefree word (Q5404353) (← links)
- Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\) (Q5408177) (← links)
- Avoiding Approximate Squares (Q5428239) (← links)
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM (Q5462674) (← links)
- (Q5710443) (← links)
- Developments in Language Theory (Q5711969) (← links)
- (Q5747369) (← links)
- Existential length universality (Q5874287) (← links)
- (Q5883504) (← links)
- Properties of a ternary infinite word (Q6041042) (← links)
- An Inequality for the Number of Periods in a Word (Q6169892) (← links)
