Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/PighizziniSW02, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/PighizziniSW02 / rank | |||
Normal rank | |||
Latest revision as of 08:57, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. |
scientific article |
Statements
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (English)
0 references
14 May 2003
0 references
formal languages
0 references
context-free grammars
0 references
pushdown automata
0 references
descriptional complexity
0 references
space complexity.
0 references
0 references
