The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet (Q1239007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet |
scientific article; zbMATH DE number 3557253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet |
scientific article; zbMATH DE number 3557253 |
Statements
The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet (English)
0 references
1977
0 references
