A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(71)90073-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090142443 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the enumeration of line chromatic trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über Unterbäume eines Baumes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the entropy of context-free languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5601350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The numbers of labeled colored and chromatic trees / rank | |||
Normal rank |
Latest revision as of 02:45, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A contect-free language and enumeration problems on infinite trees and digraphs |
scientific article |
Statements
A contect-free language and enumeration problems on infinite trees and digraphs (English)
0 references
1971
0 references