Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213): Difference between revisions

@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+Quotient complexity of ideal languages
@@ Property / cites work: Quotient complexity of ideal languages / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient complexity of closed languages
@@ Property / cites work: Quotient complexity of closed languages / rank @@
+Normal rank
@@ Property / cites work @@
+Square on Ideal, Closed and Free Languages
@@ Property / cites work: Square on Ideal, Closed and Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+Q4453205
@@ Property / cites work: Q4453205 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
@@ Property / cites work: COMPLEXITY IN UNION-FREE REGULAR LANGUAGES / rank @@
+Normal rank
@@ Property / cites work @@
+Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Complement on Free and Ideal Languages
@@ Property / cites work: Complement on Free and Ideal Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank