scientific article; zbMATH DE number 65755

MaRDI QIDQ4010366zbMATH OpenFDO

Authors Alexander Yakhnis, Vladimir Yakhnis, Anil Nerode

Publication date 27 September 1992

zbMATH Keywords

computational game modelstrategies

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(16)

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