Q5207047 (Q5207047): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.00483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633896 / 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: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism in the Presence of a Diverse or Unknown Future / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quest for a Tight Translation of Büchi to co-Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking NFA equivalence with bisimulations up to congruence / 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: Forms of Determinism for Automata (Invited Talk) / 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: The Complexity of Tree Automata and Logics of Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Games Without Determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eventually safe languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Good-for-Games Automata Good for Probabilistic Model Checking? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Width of Non-deterministic Automata / 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: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structurally Unambiguous Finite 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: Alternating finite automata on \(\omega\)-words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Automata on Infinite Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing GFG Transition-Based Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:29, 21 July 2024

scientific article; zbMATH DE number 7147439
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7147439

    Statements

    0 references
    0 references
    3 January 2020
    0 references
    finite automaton
    0 references
    automaton width
    0 references
    good-for-games automaton
    0 references
    determinisation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers