Token Games and History-Deterministic Quantitative-Automata (Q6178674): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Reasoning about online algorithms with weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Büchi Good-for-Games Automata Are Efficiently Recognizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Deterministic are Good-For-Games Automata? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6187054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token Games and History-Deterministic Quantitative-Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why These Automata Types? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative vs. weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and good for games automata: new tools for infinite duration games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding parity games in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Stabilisation Monoids and Regular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selective Approaches for Solving Weak Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Games Without Determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Regret in Discounted-Sum Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Determinisation of Good-for-Games Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability Results on the Existence of Lookahead Delegators for NFA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5028456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5207047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5114824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive synthesis without regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good-for-games ω-Pushdown Automata / rank
 
Normal rank

Revision as of 19:42, 23 August 2024

scientific article; zbMATH DE number 7788980
Language Label Description Also known as
English
Token Games and History-Deterministic Quantitative-Automata
scientific article; zbMATH DE number 7788980

    Statements

    Token Games and History-Deterministic Quantitative-Automata (English)
    0 references
    Token games and history-deterministic quantitative automata (English)
    0 references
    0 references
    0 references
    16 January 2024
    0 references
    23 January 2024
    0 references
    quantitative automata
    0 references
    history-determinism
    0 references
    token games
    0 references
    automata
    0 references
    synthesis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references