Computing Running Game with Automata Theory
This paper examines a common but unverified claim in a strand of published work applying automata theory to game design: that specifying a game as a finite automaton yields a complete, bug-resistant design. Prior work has already modeled endless-running games with finite state machines, including tested, shipped implem...