More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414): Difference between revisions

@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Deterministic Finite Cover Automata
@@ Property / cites work: Non-Deterministic Finite Cover Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5313785
@@ Property / cites work: Q5313785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3022285
@@ Property / cites work: Q3022285 / rank @@
+Normal rank
@@ Property / cites work @@
+AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+Minimal cover-automata for finite languages
@@ Property / cites work: Minimal cover-automata for finite languages / rank @@
+Normal rank
@@ Property / cites work @@
+Similarity relations and cover automata
@@ Property / cites work: Similarity relations and cover automata / rank @@
+Normal rank
@@ Property / cites work @@
+A maxmin problem on finite automata
@@ Property / cites work: A maxmin problem on finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4465333
@@ Property / cites work: Q4465333 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Minimizing nfa's and regular expressions
@@ Property / cites work: Minimizing nfa's and regular expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds for Nondeterministic State Complexity Is Hard
+Normal rank
@@ Property / cites work @@
+On the average state and transition complexity of finite languages
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
+Normal rank
@@ Property / cites work @@
+A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA  FOR FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
+Normal rank
@@ Property / cites work @@
+Q5554980
@@ Property / cites work: Q5554980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4991691
@@ Property / cites work: Q4991691 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390537
@@ Property / cites work: Q4390537 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396615
@@ Property / cites work: Q3396615 / rank @@
+Normal rank