We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problems in theoretical computer science. We focus on the...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!