A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 19:30, 19 March 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
