scientific article; zbMATH DE number 65755

MaRDI QIDQ4010366zbMATH OpenFDO

Authors Alexander Yakhnis, Vladimir Yakhnis, Anil Nerode

Publication date 27 September 1992

zbMATH Keywords

strategiescomputational game model

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Applications of game theory (91A80) 2-person games (91A05)

Recommendations

• Publication:4206380
• Publication:4206381
• Games and winning strategies
• Some programming languages suggested by game models (extended abstract)
• scientific article; zbMATH DE number 4180791

Cited in

(16)

• McNaughton games and extracting strategies for concurrent programs
• Free \(\mu\)-lattices
• scientific article; zbMATH DE number 4180791 (Why is no real title available?)
• scientific article; zbMATH DE number 4126677 (Why is no real title available?)
• Extracting winning strategies in update games
• scientific article; zbMATH DE number 4126676 (Why is no real title available?)
• Gurevich-Harrington's games defined by finite automata
• Games with Unknown Past
• Infinite games played on finite graphs
• Some programming languages suggested by game models (extended abstract)
• Asynchronous games. II: The true concurrency of innocence
• From parity games to circular proofs
• Input-Output Model Programs
• Pushdown processes: Games and model-checking
• Effective strategies for enumeration games
• The variable hierarchy for the games \(\mu \)-calculus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010366)