On permutative grammars generating context-free languages (Q1068558): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A general class of noncontext free grammars generating context free languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-context-free grammars generating context-free languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of context-sensitive grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A normal form theorem for label grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Associate languages and derivational complexity of formal grammars and languages / rank | |||
Normal rank | |||
Latest revision as of 10:24, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On permutative grammars generating context-free languages |
scientific article |
Statements
On permutative grammars generating context-free languages (English)
0 references
1985
0 references
A grammar is said to be permutative if it has permutation productions of the form AB\(\to BA\) in addition to context-free productions. Szilard languages and label languages are studied as examples of languages generable by permutative grammars. Particularly, sufficient conditions for a permutative grammar to generate a context-free language are studied.
0 references
Szilard languages
0 references
label languages
0 references
