Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002): Difference between revisions

@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Quotient Complexities of Atoms in Regular Ideal Languages
+Normal rank
@@ Property / cites work @@
+Theory of átomata
@@ Property / cites work: Theory of átomata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799353
@@ Property / cites work: Q4799353 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds for Nondeterministic State Complexity Is Hard
+Normal rank
@@ Property / cites work @@
+Complexity of atoms, combinatorially
@@ Property / cites work: Complexity of atoms, combinatorially / rank @@
+Normal rank
@@ Property / cites work @@
+THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
+Normal rank
@@ Property / cites work @@
+On the State Minimization of Nondeterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+Minimal NFA and biRFSA Languages
@@ Property / cites work: Minimal NFA and biRFSA Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Automaton Transformations
@@ Property / cites work: Linear Automaton Transformations / rank @@
+Normal rank
@@ Property / cites work @@
+On the state complexity of reversals of regular languages
+Normal rank
@@ Property / cites work @@
+Q2893313
@@ Property / cites work: Q2893313 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Minimality Results on Biresidual and Biseparable Automata
+Normal rank
@@ Property / cites work @@
+Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
+Normal rank
@@ Property / cites work @@
+New Interpretation and Generalization of the Kameda-Weiner Method.
+Normal rank