Q5091262 (Q5091262): Difference between revisions

@@ Property / cites work @@
+Hyper-minimizing minimized deterministic finite state automata
+Normal rank
@@ Property / cites work @@
+Büchi Good-for-Games Automata Are Efficiently Recognizable
+Normal rank
@@ Property / cites work @@
+Nondeterminism in the Presence of a Diverse or Unknown Future
+Normal rank
@@ Property / cites work @@
+How Deterministic are Good-For-Games Automata?
@@ Property / cites work: How Deterministic are Good-For-Games Automata? / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+The Theory of Stabilisation Monoids and Regular Cost Functions
+Normal rank
@@ Property / cites work @@
+Q4422087
@@ Property / cites work: Q4422087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4804928
@@ Property / cites work: Q4804928 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Deterministic Lattice Automata
@@ Property / cites work: Minimizing Deterministic Lattice Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Fair simulation
@@ Property / cites work: Fair simulation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4045961
@@ Property / cites work: Q4045961 / rank @@
+Normal rank
@@ Property / cites work @@
+HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+On Determinisation of Good-for-Games Automata
@@ Property / cites work: On Determinisation of Good-for-Games Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Automata
@@ Property / cites work: Lattice Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Relating word and tree automata
@@ Property / cites work: Relating word and tree automata / rank @@
+Normal rank
@@ Property / cites work @@
+Decision problems forω-automata
@@ Property / cites work: Decision problems forω-automata / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient minimization of deterministic weak \(\omega\)-automata
+Normal rank
@@ Property / cites work @@
+Minimizing finite automata is computationally hard
+Normal rank
@@ Property / cites work @@
+Linear Automaton Transformations
@@ Property / cites work: Linear Automaton Transformations / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 98. 15th annual symposium on theoretical aspects of computer science. Paris, France, February 25--27, 1998. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4991691
@@ Property / cites work: Q4991691 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
+Normal rank
@@ Property / cites work @@
+Limit-Deterministic Büchi Automata for Linear Temporal Logic
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about infinite computations
@@ Property / cites work: Reasoning about infinite computations / rank @@
+Normal rank