On the context-free production complexity of finite languages (Q1098318): Difference between revisions

@@ Property / author @@
-Zsolt Tuza
@@ Property / author: Zsolt Tuza / rank @@
-Normal rank
@@ Property / author @@
+Zsolt Tuza
@@ Property / author: Zsolt Tuza / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A lower-bound for the number of productions required for a certain class of languages
+Normal rank
@@ Property / cites work @@
+Context-free complexity of finite languages
@@ Property / cites work: Context-free complexity of finite languages / rank @@
+Normal rank
@@ Property / cites work @@
+Concise description of finite languages
@@ Property / cites work: Concise description of finite languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank