Ambiguity plays an important role in checking the relevances of formalism for natural language processing. As contextual grammars were shown to be an appropriate description for natural languages, analyzing syntactic ambiguity of contextual grammars deserves a special attention. The levels of ambiguity of internal contextual grammars are defined depending on the information used for describing a derivation. In this paper, we continue the study on ambiguity of internal contextual grammars which was investigated in [3] and [13]. We achieve solutions to the following open problems addressed in the above papers. For each (i, j) ∈ {(2, 1), (1, 0), (0, 1)}, are there languages which are inherently i-ambiguous with respect to grammars with arbitrary selector, but j-ambiguous with respect to grammars with finite selector?
CITATION STYLE
Kuppusamy, L. (2006). Further results on syntactic ambiguity of internal contextual grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4002 LNAI, pp. 132–143). Springer Verlag. https://doi.org/10.1007/11780885_14
Mendeley helps you to discover research relevant for your work.