Effective strategies for enumeration games
From MaRDI portal
Publication:6560179
DOI10.1007/3-540-61377-3_49zbMATH Open1540.68133MaRDI QIDQ6560179FDOQ6560179
Publication date: 21 June 2024
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatorial games (91A46) Applications of computability and recursion theory (03D80) Algorithmic game theory and complexity (91A68)
Cites Work
- Classical recursion theory. The theory of functions and sets of natural numbers
- Complexity of winning strategies
- On the synthesis of strategies in infinite games
- On the synthesis of discrete controllers for timed systems
- Infinite games played on finite graphs
- Solving Sequential Conditions by Finite-State Strategies
- On some games which are relevant to the theory of recursively enumerable sets
- Supervision of Infinite Behavior of Discrete-Event Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Effective strategies for enumeration games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560179)
