15 citations · 35 across the 8 of their papers we have counts for
10 papers
Words avoiding reversed subwords
Narad Rampersad, Jeffrey Shallit
We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.
A Generalization of Repetition Threshold
Lucian Ilie, Jeffrey Shallit
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number alpha such that there exists an infinite word over a k-letter alphabet…
The 2-adic valuation of the coefficients of a polynomial
G. Boros, V. Moll, J. Shallit
In this paper we compute the 2-adic valuations of some polynomials associated with the definite integral
Avoiding large squares in infinite binary words
Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| >= 4; our…
State Complexity and the Monoid of Transformations of a Finite Set
Bryan Krawetz, John Lawrence, Jeffery Shallit
In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set.…
Simultaneous avoidance of large squares and fractional powers in infinite binary words
Jeffrey Shallit
In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional…