Minimizing GFG Transition-Based Automata (Q5091262): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Minimizing GFG Transition-Based Automata
Property / cites work
 
Property / cites work: Hyper-minimizing minimized deterministic finite state 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: Nondeterminism in the Presence of a Diverse or Unknown Future / 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: Q5525343 / 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: Q4422087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Deterministic Lattice Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / 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: Lattice Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating word and tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems forω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient minimization of deterministic weak \(\omega\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing finite automata is computationally hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 98. 15th annual symposium on theoretical aspects of computer science. Paris, France, February 25--27, 1998. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4991691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit-Deterministic Büchi Automata for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10676/pdf/LIPIcs-ICALP-2019-100.pdf / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966079298 / rank
 
Normal rank
Property / title
 
Minimizing GFG Transition-Based Automata (English)
Property / title: Minimizing GFG Transition-Based Automata (English) / rank
 
Normal rank

Latest revision as of 09:17, 30 July 2024

scientific article; zbMATH DE number 7561593
Language Label Description Also known as
English
Minimizing GFG Transition-Based Automata
scientific article; zbMATH DE number 7561593

    Statements

    0 references
    0 references
    21 July 2022
    0 references
    minimization
    0 references
    deterministic co-Büchi automata
    0 references
    Minimizing GFG Transition-Based Automata (English)
    0 references

    Identifiers