FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421): Difference between revisions

@@ Property / cites work @@
+A very hard log-space counting class
@@ Property / cites work: A very hard log-space counting class / rank @@
+Normal rank
@@ Property / cites work @@
+HYPER-MINIMIZATION IN O(n<sup>2</sup>)
@@ Property / cites work: HYPER-MINIMIZATION IN O(n<sup>2</sup>) / rank @@
+Normal rank
@@ Property / cites work @@
+The parallel complexity of finite-state automata problems
+Normal rank
@@ Property / cites work @@
+An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+New problems complete for nondeterministic log space
+Normal rank
@@ Property / cites work @@
+Polynomial Space Counting Problems
@@ Property / cites work: Polynomial Space Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+OPTIMAL HYPER-MINIMIZATION
@@ Property / cites work: OPTIMAL HYPER-MINIMIZATION / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank