Thumbnail
Access Restriction
Open

Author Fijalkow, Nathanaël ♦ Horn, Florian ♦ Kuperberg, Denis ♦ Skrzypczak, Michaa L.
Source Hyper Articles en Ligne (HAL)
Content type Text
File Format PDF
Language English
Subject Keyword info ♦ Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Abstract We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the size of the memory and the bound achieved on the counters, which has been conjectured by Colcombet and Löding. We show that unfortunately this conjecture does not hold: there is no trade-off between bounds and memory, even for finite arenas. On the positive side, we prove the existence of a trade-off for the special case of thin tree arenas.
Part of series Automata, Languages, and Programming nd International Colloquium, ICALP , Kyoto, Japan, July -, , Proceedings,
Educational Use Research
Learning Resource Type Proceeding