A note on the sufficiency of Sokolowski's criterion for context-free languages (Q1169297): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2097823921 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292904 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4168086 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A helpful result for proving inherent ambiguity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for proving programming languages non context-free / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A strong pumping lemma for context-free languages / rank | |||
Normal rank | |||
Latest revision as of 16:53, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the sufficiency of Sokolowski's criterion for context-free languages |
scientific article |
Statements
A note on the sufficiency of Sokolowski's criterion for context-free languages (English)
0 references
1982
0 references
