Trading Bounds for Memory in Games with Counters

DOI10.1007/978-3-662-47666-6_16zbMath1441.91002arXiv1709.03121OpenAlexW1091982525MaRDI QIDQ3449476

Denis Kuperberg, Florian Horn, Michał Skrzypczak, Nathanaël Fijalkow

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.03121

zbMATH Keywords

trading bounds for memorytwo-player games with counters

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Quantifying Bounds in Strategy Logic

Cites Work

• Limitedness theorem on finite automata with distance functions: An algebraic proof
• Improved limitedness theorems on finite automata with distance functions
• Regular Cost Functions, Part I: Logic and Algebra over Words
• Decidability Results for the Boundedness Problem
• Weak Cost Monadic Logic over Infinite Trees
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Weak alternating automata are not that weak
• On semigroups of matrices over the tropical semiring
• Two-way cost automata and cost logics over infinite trees
• Computer Science Logic
• Distance desert automata and the star height problem
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Trading Bounds for Memory in Games with Counters