Professor
Joined School 1990
AB (Princeton),
PhD (Berkeley)
| shallit@uwaterloo.ca | |
| Web | http://www.cs.uwaterloo.ca/~shallit |
| Voice | 519-888-4567 x34804 |
| Fax | 519-885-1208 |
|
| Jeffrey O Shallit
Professor Joined School 1990 AB (Princeton),
|
Professor Shallit is interested in the interplay between number theory, algebra, discrete mathematics and the theory of computation. Most of his recent work focuses on combinatorics on words and automata theory.
Combinatorics on words is the study of properties of strings of symbols. A common theme is avoidability properties, such as, does there exist an infinite string on 3 symbols that avoids squares, that is, all subwords of the form xx, where x is a string?
Automata theory studies the properties of simple models of computation. There one of the themes is state complexity: the smallest number of states required to accept certain languages.
Another one of his interests is algorithmic number theory (the design and analysis of integer factorization and primality testing).
Finally, Professor Shallit has also written on subjects as diverse as computer graphics, history of mathematics and computer science, and science versus pseudoscience.
Marsland Faculty Fellow (2010-2013); ACM Distinguished Scientist (2008); Outstanding Performance Award, University of Waterloo (2006); Faculty of Mathematics Fellow, University of Waterloo (2004-2006)
Professor Shallit spent his most recent sabbatical at MIT, where he worked on several book projects.
J. Shallit. A Second Course in Formal Languages and Automata Theory. Cambridge University Press, 2009.
J.-Y. Kao, N. Rampersad, J. Shallit, and M. Silva. Words avoiding repetitions in arithmetic progressions. Theoret. Comput. Sci., 391:126-137, 2008.
P. Ochem, L. Ilie, and J. Shallit. A generalization of repetition threshold. Theoret. Comput. Sci., 345:359-369, 2005.
J.-P. Allouche and J. Shallit. Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, 2003.
E. Bach and J. Shallit. Algorithmic Number Theory, Vol. 1, Efficient Algorithms, MIT Press, 1996.
David R. Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
Tel: 519-888-4567 x33293
Fax: 519-885-1208
Contact | Feedback: cs-webmaster@cs.uwaterloo.ca | David R. Cheriton School of Computer Science | Faculty of Mathematics
Last modified: Monday, 20-Dec-2010 14:30:06 EST
