(P. Stockmeyer, January 27 2005) Page 5: Insert Â· Â· Â· before akâˆ’2 in the rhs of line 13. (Joel Noche, December 6 2011) Page 6: In line âˆ’8, the domain of d should be AÃ— A, not A. (D. Pal, September 21â€¦ (More)

Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open. In this paper we sketch some new results and discuss whatâ€¦ (More)

Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually coveredâ€¦ (More)

It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line betweenâ€¦ (More)

In this paper we give the cost, in terms of states, of some basic operations (union, intersection, concatenation, and Kleene star) on regular languages in the unary case (where the alphabet containsâ€¦ (More)

A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2, . . . expresses a non-negative integer n as a sum n = âˆ‘i j=0 ajuj . In this case we say the stringâ€¦ (More)

26th Annual Symposium on Foundations of Computerâ€¦

1985

This paper discusses some new integer factoring methods involving cyclotomic polynomials. There are several polynomials f(X) known to have the following property: given a multiple of f(p), we canâ€¦ (More)