Login
Talks & Seminars
Rewrite Games
Benny George, STCS, TIFR
Date & Time: October 28, 2005 11:45
Venue: CSE Seminar Hall
Abstract:
For a terminating rewrite $R$ and a ground term $t_{1}$, two players alternate in doing $R-$reductions. The player who cannot make a move loses. We will see how a long standing open problem in combinatorial game theory (Do all finite octal games have an ultimately periodic Sprague-Grundy sequence?) can be reformulated as a question about rationality of some tree languages.
Speaker Profile:
Benny George is a research scholar in the School of Technology and Computer Science, TIFR, Mumbai. His areas of interest include logic, algorithms, complexity theory and algebra.
List of Talks

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback