Descriptional Complexity of Bounded Context-Free Languages (Q5428242): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1007/978-3-540-73208-2_30 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1925197043 / rank | |||
Normal rank | |||
Latest revision as of 21:47, 19 March 2024
scientific article; zbMATH DE number 5215384
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Descriptional Complexity of Bounded Context-Free Languages |
scientific article; zbMATH DE number 5215384 |
Statements
Descriptional Complexity of Bounded Context-Free Languages (English)
0 references
28 November 2007
0 references
descriptional complexity
0 references
finite-turn pushdown automata
0 references
recursive trade-offs
0 references
bounded languages
0 references
