Narad Rampersad
Browse by
Recent Submissions
-
On avoidability of formulas with reversal
(EDP Sciences, 2018-02-13)While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas ... -
Squares and overlaps in the Thue-Morse sequence and some variants
(EDP Sciences, 2006)We consider the position and number of occurrences of squares in the Thue-Morse sequence, and show that the corresponding sequences are 2-regular. We also prove that changing any finite but nonzero number of bits in the ... -
A family of formulas with reversal of high avoidability index
(World Scientific, 2017)We present an infinite family of formulas with reversal whose avoidability index is bounded between 4 and 5, and we show that several members of the family have avoidability index 5. This family is particularly interesting ... -
Suffix conjugates for a class of morphic subshifts
(Cambridge University Press, 2015-09)Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and ... -
Cyclic Complexity of Some Infinite Words and Generalizations
(Integers, 2018-03)Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the ... -
Overlap-Free Words and Generalizations
(University of WinnipegUniversity of Waterloo, 2007)The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains ... -
Further applications of a power series method for pattern avoidance
(The Electronic Journal of Combinatorics, 2011-06-21)In combinatorics on words, a word w over an alphabet ∑ is said to avoid a pattern p over an alphabet ∆ if there is no factor x of w and no non-erasing morphism h from ∆* to ∑* such that h(p) = x. Bell and Goh have recently ... -
The minimal automaton recognizing mN in a linear numeration system
(Integers, 2011-12-02)We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component ... -
Multi-dimensional sets recognizable in all abstract numeration systems
(EDP Sciences, 2011)We prove that the subsets of Nd that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting. -
Shuffling and unshuffling
(Bulletin of the European Association for Theoretical Computer Science, 2012)We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal ... -
Automaticity of Primitive Words and Irreducible Polynomials
(Discrete Mathematics and Theoretical Computer Science, 2013)If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all ... -
Abelian complexity of fixed point of morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1
(Integers, 2014-02-20)We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds ... -
Words with many palindrome pair factors
(The Electronic Journal of Combinatorics, 2015-10-30)Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word ... -
Avoiding approximate repetitions with respect to the longest common subsequence distance
(Mathematical Sciences Publishers, 2015-09-17)Ochem, Rampersad, and Shallit gave various examples of infinite words avoiding what they called approximate repetitions. An approximate repetition is a factor of the form x x', where x and x' are close to being identical. ... -
Least Periods of Factors of Infinite Words
(EDP Sciences, 2009)We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci ... -
Dejean's conjecture holds for n ≥ 27
(EDP Sciences, 2009)We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible. -
Infinite words containing squares at every position
(EDP Sciences, 2010)Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there exists an infinite word that avoids α-powers but contains arbitrarily large squares beginning at every position? We resolve ... -
Cubefree words with many squares
(Discrete Mathematics and Theoretical Computer Science, 2014-05-13)We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n. -
Binary Words Containing Infinitely Many Overlaps
(The Electronic Journal of Combinatorics, 2006-09-22)We characterize the squares occurring in infinite overlap-free binary words and construct various α power-free binary words containing infinitely many overlaps.
RSS 1.0