On Dominational Ambiguity of Context-Free Languages

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.