ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086): Difference between revisions

@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / 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 @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+The state complexity of \(L^{2}\) and \(L^k\)
@@ Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588675
@@ Property / cites work: Q5588675 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023070
@@ Property / cites work: Q4023070 / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank