ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS (Q5704380): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reversal-bounded multipushdown machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763798 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Electronic Numerical Integrator and Computer (ENIAC) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Unsolvability of the Recognition of Linear Context-Free Languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Latest revision as of 11:44, 11 June 2024
scientific article; zbMATH DE number 2228603
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS |
scientific article; zbMATH DE number 2228603 |
Statements
ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS (English)
0 references
14 November 2005
0 references
non-recursive trade-off
0 references
decidability
0 references
