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
138
click to vote
FCT
2009
Springer
160
views
Applied Computing
»
more
FCT 2009
»
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
15 years 6 months ago
Download
www-i7.informatik.rwth-aachen.de
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
claim paper
Read More »