On the Trade-off Between Ambiguity and Complexity in Contextual Languages

Authors:
Lakshmanan Kuppusamy;Anand Mahendran;Kamala Krithivasan
Affiliations:
School of Computing Science and Engineering, VIT University, Vellore 632 014, India. klakshma@vit.ac.in;School of Computing Science and Engineering, VIT University, Vellore 632 014, India. manand@vit.ac.in;Department of Computer Science and Engineering, IIT Madras, Chennai 600 036, India. kamala@iitm.ac.in
Venue:
Fundamenta Informaticae
Year:
2013

Citing 4
Cited 0

On computational complexity of contextual languages

Theoretical Computer Science - Special issue: formal language theory
Marcus Contextual Grammars

Marcus Contextual Grammars
A note on ambiguity of internal contextual grammars

Theoretical Computer Science
On Probabilistic Contextual Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contextual grammars are introduced by Solomon Marcus in 1969 based on the fundamental concept of descriptive linguistics of insertion of strings in given contexts. Internal contextual grammars are introduced by Păun and Nguyen in 1980. For contextual grammars several descriptional complexity measures and levels of ambiguity have been defined. In this paper, we analyze the trade-off between ambiguity and complexity of languages generated by internal contextual grammars. The notion of a pseudo inherently ambiguous language with respect to two complexity measures is introduced and investigated. These languages can be generated by unambiguous grammars which are minimal with respect to one measure and ambiguous if they are minimal with respect to the other measure. An open problem from [15] is solved in this framework.