作者: Abraham Neyman
DOI: 10.1007/978-3-642-60454-6_16
关键词: Discrete mathematics 、 Mobile automaton 、 Timed automaton 、 Nondeterministic finite automaton 、 Two-way deterministic finite automaton 、 Theoretical computer science 、 Deterministic automaton 、 Mathematics 、 Probabilistic automaton 、 ω-automaton 、 Büchi automaton
摘要: This chapter studies the implications of bounding complexity players’ strategies in long term interactions. The a strategy is measured by size minimal automaton that can implement it.