Rampersad, N., Shallit, J., Xu, Z.
In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Sigma is the set of all prefixes (resp.,...
ON PATTERNS OCCURRING IN BINARY ALGEBRAIC NUMBERS (2008)
Abstract. We prove that every algebraic number contains infinitely many occurrences of 7/3-powers in its binary expansion. Using the same approach, we also show that every algebraic number contains...
A Study on Unique Rational Operations (2008)
N. Rampersad, B. Ravikumar, N. Santean, J. Shallit
Abstract. For each basic language operation we define its “unique ” counterpart as being the operation which results in a language whose words can be obtain uniquely through the given operation....