A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982): Difference between revisions

@@ Property / cites work @@
+A note on the enumeration of line chromatic trees
@@ Property / cites work: A note on the enumeration of line chromatic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Über Unterbäume eines Baumes
@@ Property / cites work: Über Unterbäume eines Baumes / rank @@
+Normal rank
@@ Property / cites work @@
+On the entropy of context-free languages
@@ Property / cites work: On the entropy of context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5601350
@@ Property / cites work: Q5601350 / rank @@
+Normal rank
@@ Property / cites work @@
+The numbers of labeled colored and chromatic trees
+Normal rank