scientific article; zbMATH DE number 65755

zbMATH Open0746.68046MaRDI QIDQ4010366FDOQ4010366

Authors: Alexander Yakhnis, Vladimir Yakhnis, Anil Nerode 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

strategiescomputational game model

Mathematics Subject Classification ID

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

Cited In (16)

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

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)