DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853): Difference between revisions

@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Communication complexity method for measuring nondeterminism in finite automata
+Normal rank
@@ Property / cites work @@
+Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
+Normal rank
@@ Property / cites work @@
+A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
+Normal rank
@@ Property / cites work @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank