Sotabase

Career

· Professor Emeritus, University of Waterloo2024–
· Professor, University of Waterloo1990–2024
· Assistant Professor, Dartmouth College1988–1990
· Assistant Professor, University of Chicago1983–1988
· Doctor of Philosophy (Ph.D.), Mathematics, University of California, Berkeley1979–1983
· AB, Mathematics, Princeton University1975–1979
· High School Diploma, Lower Merion High School1971–1975

Publications (388)

Algorithmic number theory
1996
885
cited
Automatic Sequences: Theory, Applications, Generalizations
2003
463
cited
The Ubiquitous Prouhet-Thue-Morse Sequence
Sequences and Their Applications · 1998
455
cited
Automatic Sequences: Uniform Morphisms and Automatic Sequences
2003
339
cited
The Ring of k-Regular Sequences
Theoretical Computer Science · 1990
269
cited
The ring of k-regular sequences, II
Theoretical Computer Science · 2003
190
cited
The Computational Complexity of Some Problems of Linear Algebra
Journal of computer and system sciences (Print) · 1996
173
cited
Regular Expressions: New Results and Open Problems
J. Autom. Lang. Comb. · 2004
154
cited
ALGEBRAIC COMBINATORICS ON WORDS (Encyclopedia of Mathematics and its Applications 90) By M. LOTHAIRE: 504 pp., £60.00, ISBN 0 521 81220 8 (Cambridge University Press, 2002)
2003
143
cited
Unary Language Operations, State Complexity and Jacobsthal's Function
International Journal of Foundations of Computer Science · 2002
129
cited
A Lower Bound Technique for the Size of Nondeterministic Finite Automata
Information Processing Letters · 1996
124
cited
Numeration Systems, Linear Recurrences, and Regular Sets
Information and Computation · 1992
99
cited
Simple continued fractions for some irrational numbers, II
1979
98
cited
On the iteration of certain quadratic maps over GF(p)
Discrete Mathematics · 2004
96
cited
Characterizing Regular Languages with Polynomial Densities
International Symposium on Mathematical Foundations of Computer Science · 1992
86
cited
Enumeration and Decidable Properties of Automatic Sequences
International Journal of Foundations of Computer Science · 2011
84
cited
On the Number of Distinct Languages Accepted by Finite Automata with n States
Workshop on Descriptional Complexity of Formal Systems · 2002
84
cited
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory · 2003
80
cited
Proving Darwin: Making Biology Mathematical
2012
76
cited
A Generalization of Automatic Sequences
Theoretical Computer Science · 1988
71
cited
Sotabase
Jeffrey Shallit | Researcher Profile | Sotabase | Sotabase