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

@@ Property / author @@
+Werner Kuich
@@ Property / author: Werner Kuich / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(71)90073-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2090142443
@@ Property / OpenAlex ID: W2090142443 / rank @@
+Normal rank
@@ 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