On permutative grammars generating context-free languages |
| |
| Authors: | Erkki Mäkinen |
| |
| Institution: | (1) Department of Mathematical Sciences / Computer Science, University of Tampere, P.O. Box 607, SF-33101 Tampere, Finland |
| |
| Abstract: | A grammar is said to be permutative if it has permutation productions of the formAB  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.This work was supported by the Academy of Finland. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
