Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
A context-free grammar G is ambiguous if there is a word that can be generated by G with at least two different derivation trees. Ambiguous grammars are often distinguished by their degree of ambiguity, which is the maximal number of derivation trees for the words generated by them. If there is no such upper bound G is said to be ambiguous of infinite degree. By considering how many derivation trees a word of at most length n may have, we can distinguish context-free grammars with infinite degree of ambiguity by the growth-rate of their ambiguity with respect to the length of the words. It is known that each cycle-free context-free grammar G is either exponentially ambiguous or its ambiguity is bounded by a polynomial. Until now there have only been examples of context-free languages with inherent ambiguity 2Θ|(n) and Θ(nd) for each d ∈ N0. In this paper first examples of (linear) context-free languages with nonconstant sublinear ambiguity are presented.