A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982)
From MaRDI portal
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
