A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001): Difference between revisions

@@ Property / author @@
-Mike S. Paterson
@@ Property / author: Mike S. Paterson / rank @@
-Normal rank
@@ Property / author @@
+Mike S. Paterson
@@ Property / author: Mike S. Paterson / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+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 @@
+Q4779161
@@ Property / cites work: Q4779161 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3915990
@@ Property / cites work: Q3915990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5554980
@@ Property / cites work: Q5554980 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680279
@@ Property / cites work: Q3680279 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(02)00891-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2062010498
@@ Property / OpenAlex ID: W2062010498 / rank @@
+Normal rank