On permutative grammars generating context-free languages (Q1068558)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On permutative grammars generating context-free languages |
scientific article; zbMATH DE number 3932415 |
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
0.841496467590332
0 references
0.8056448698043823
0 references
0.7986427545547485
0 references
0.7984223365783691
0 references
0.7917446494102478
0 references
