Titlebook: STACS 2007; 24th Annual Symposiu Wolfgang Thomas,Pascal Weil Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Automat.alg

相符

Symmetries and the Complexity of Pure Nash Equilibriumyers is unbounded, is that players cannot (or need not) distinguish between the other players. We define four classes of symmetric games by considering two additional properties: . for all players and the ability to . from the other players. Based on these varying notions of symmetry, we investigate

legacy

atopic

慢慢流出

Compact Forbidden-Set Routingor graphs of tree width ., we give a routing scheme using routing tables of size .(..log..). We introduce m-clique width, generalizing clique width, to show that graphs of m-clique width . also have a routing scheme using size .(..log..) tables.

脱水

On the Size of the Universal Automaton of a Regular Languagenimal deterministic automaton with respect to the smallest NFA is tightly bounded by the Landau’s function; we show that the size of the universal automaton is in this case an exponential of the Landau’s function.

放纵

Density

GROG

A First Investigation of Sturmian Treesh .. As for the case of words, Sturmian trees are irrational trees of minimal complexity. We give various examples of Sturmian trees, and we characterize one family of Sturmian trees by means of a structural property of their automata.

attenuate

978-3-540-70917-6Springer-Verlag Berlin Heidelberg 2007