Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.02.063
+Normal rank
@@ Property / OpenAlex ID @@
+W1968090455
@@ Property / OpenAlex ID: W1968090455 / rank @@
+Normal rank
@@ Property / cites work @@
+Ambiguity in Graphs and Expressions
@@ Property / cites work: Ambiguity in Graphs and Expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Q4337605
@@ Property / cites work: Q4337605 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Expressions and NFAs Without ε-Transitions
+Normal rank
@@ Property / cites work @@
+Q4040284
@@ Property / cites work: Q4040284 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Techniques: Regular expression search algorithm
+Normal rank