|
Problemy Peredachi Informatsii, 1978, Volume 14, Issue 2, Pages 86–98
(Mi ppi1538)
|
|
|
|
Theory of Languages
On Dominational Ambiguity of Context-Free Languages
S. L. Modina
Abstract:
The article considers so-called generalized tree domination grammars that assign subordination trees to the generated strings. It is shown that the class of languages generated by unambiguous generalized tree domination grammars (i.e., grammars that associate a unique subordination tree with each generated string), are strictly intermediate between the classes of unambiguous CF-languages and all CF-languages.
Received: 09.04.1976
Citation:
S. L. Modina, “On Dominational Ambiguity of Context-Free Languages”, Probl. Peredachi Inf., 14:2 (1978), 86–98; Problems Inform. Transmission, 14:2 (1978), 138–147
Linking options:
https://www.mathnet.ru/eng/ppi1538 https://www.mathnet.ru/eng/ppi/v14/i2/p86
|
Statistics & downloads: |
Abstract page: | 160 | Full-text PDF : | 84 |
|