Characterizing regular languages with polynomial densities (Q5096862): Difference between revisions

@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Q3994777
@@ Property / cites work: Q3994777 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4186322
@@ Property / cites work: Q4186322 / rank @@
+Normal rank
@@ Property / cites work @@
+A homomorphic characterization of regular languages
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4506483
@@ Property / cites work: Q4506483 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3704880
@@ Property / cites work: Q3704880 / rank @@
+Normal rank
@@ Property / cites work @@
+Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
+Normal rank
@@ Property / cites work @@
+Q3680279
@@ Property / cites work: Q3680279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4155837
@@ Property / cites work: Q4155837 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite counting automata
@@ Property / cites work: Finite counting automata / rank @@
+Normal rank
@@ Property / cites work @@
+Can the catenation of two weakly sparse languages be dense?
+Normal rank