Login / Signup
Büchi Good-for-Games Automata Are Efficiently Recognizable.
Marc Bagnol
Denis Kuperberg
Published in:
FSTTCS (2018)
Keyphrases
</>
finite automata
cellular automata
nash equilibrium
regular expressions
game development
game theory
video games
case study
pattern matching
multiagent systems
stochastic games
lattice gas