On the context-free production complexity of finite languages (Q1098318): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q175498 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Zsolt Tuza / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower-bound for the number of productions required for a certain class of languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Context-free complexity of finite languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Concise description of finite languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5678435 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices / rank | |||
Normal rank | |||
Latest revision as of 14:53, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the context-free production complexity of finite languages |
scientific article |
Statements
On the context-free production complexity of finite languages (English)
0 references
1987
0 references
finite language
0 references
context-free productions
0 references
