Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
86
click to vote
TARK
1998
Springer
74
views
Automated Reasoning
»
more
TARK 1998
»
Beating a Finite Automaton in the Big Match
15 years 7 months ago
Download
people.cs.uchicago.edu
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
Lance Fortnow, Peter G. Kimmel
claim paper
Read More »