A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:01, 3 February 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
