Token Games and History-Deterministic Quantitative-Automata

DOI10.46298/lmcs-19(4:8)2023arXiv2110.14308MaRDI QIDQ6178674

Udi Boker, Karoliina Lehtinen

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science, Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

synthesisautomataquantitative automatahistory-determinismtoken games

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Theory of software (68Nxx) Computer science (68-XX)

Related Items (2)

History-deterministic timed automata are not determinizable ⋮ Token Games and History-Deterministic Quantitative-Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive synthesis without regret
• The complexity of mean payoff games on graphs
• Universal graphs and good for games automata: new tools for infinite duration games
• Quantitative vs. weighted automata
• Quantitative languages
• Decidability Results on the Existence of Lookahead Delegators for NFA
• On Determinisation of Good-for-Games Automata
• Selective Approaches for Solving Weak Games
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Deciding parity games in quasipolynomial time
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• How Deterministic are Good-For-Games Automata?
• Good-for-games ω-Pushdown Automata
• Why These Automata Types?
• Minimizing Regret in Discounted-Sum Games
• Stochastic Games
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
• Token Games and History-Deterministic Quantitative-Automata

This page was built for publication: Token Games and History-Deterministic Quantitative-Automata