On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436): Difference between revisions

@@ Property / author @@
-Juraj Hromkovič
@@ Property / author: Juraj Hromkovič / rank @@
-Normal rank
@@ Property / author @@
+Juraj Hromkovič
@@ Property / author: Juraj Hromkovič / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.03.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2042919731
@@ Property / OpenAlex ID: W2042919731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4465328
@@ Property / cites work: Q4465328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4412107
@@ Property / cites work: Q4412107 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4005202
@@ Property / cites work: Q4005202 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ 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 geometrical view of the determinization and minimization of finite-state automata
+Normal rank
@@ Property / cites work @@
+A comparison of two lower-bound methods for communication complexity
+Normal rank
@@ Property / cites work @@
+Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
+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 @@
+Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
+Normal rank
@@ Property / cites work @@
+Q4337605
@@ Property / cites work: Q4337605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739596
@@ Property / cites work: Q4739596 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3768423
@@ Property / cites work: Q3768423 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754144
@@ Property / cites work: Q2754144 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity method for measuring nondeterminism in finite automata
+Normal rank
@@ Property / cites work @@
+Ambiguity and Communication
@@ Property / cites work: Ambiguity and Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4699286
@@ Property / cites work: Q4699286 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the State Minimization of Nondeterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5203681
@@ Property / cites work: Q5203681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptional Complexity of Nondeterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
+Normal rank
@@ Property / cites work @@
+State complexity of combined operations
@@ Property / cites work: State complexity of combined operations / rank @@
+Normal rank