Minimizing finite automata is computationally hard (Q703578): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple-entry finite automata
@@ Property / cites work: Multiple-entry finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of automaton identification from given data
+Normal rank
@@ Property / cites work @@
+On measuring nondeterminism in regular languages
@@ Property / cites work: On measuring nondeterminism in regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4531373
@@ Property / cites work: Q4531373 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4045961
@@ Property / cites work: Q4045961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+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 @@
+Q4503150
@@ Property / cites work: Q4503150 / rank @@
+Normal rank
@@ Property / cites work @@
+Amounts of nondeterminism in finite automata
@@ Property / cites work: Amounts of nondeterminism in finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+On finite automata with limited nondeterminism
@@ Property / cites work: On finite automata with limited nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank