Descriptional Complexity of Bounded Context-Free Languages (Q5428242)
From MaRDI portal
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
