Monday, November 26, 2012 4:00 pm
-
4:00 pm
EST (GMT -05:00)
Jeffrey Shallit, School of Computer Science, University of Waterloo
"Rational numbers and automata"
In this talk, I will describe a new model for describing certain sets S of rational numbers using finite automata. We will see that it is decidable if every element of S is an integer, and that sup S is computable. However, closely related questions are still open. There are applications to combinatorics on words.
Refreshments will be served in MC 5046 at 3:30pm. All are welcome.