Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article

From MaRDI portal
Publication:4010366
Jump to:navigation, search

zbMATH Open0746.68046MaRDI QIDQ4010366FDOQ4010366

Vladimir Yakhnis, Anil Nerode, Alexander Yakhnis

Publication date: 27 September 1992



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


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 (11)

  • Effective strategies for enumeration games
  • Asynchronous games. II: The true concurrency of innocence
  • Extracting Winning Strategies in Update Games
  • From parity games to circular proofs
  • McNaughton games and extracting strategies for concurrent programs
  • The variable hierarchy for the games \(\mu \)-calculus
  • Free \(\mu\)-lattices
  • Pushdown processes: Games and model-checking
  • Infinite games played on finite graphs
  • Games with Unknown Past
  • 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4010366&oldid=17709816"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 01:29. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki