Universal Inherence of Cycle-Free Context-Free Ambiguity Functions

Authors:
Klaus Wich
Affiliations:
-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 1
Cited 1

Sublinear Ambiguity

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science

Sublogarithmic ambiguity

Theoretical Computer Science - Mathematical foundations of computer science 2004

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the set of inherent ambiguityfunctions for context-free languages and the set of ambiguity functions for cycle-free context-free grammars coincide. Moreover for each census function 驴 of an unambiguous context-free language the least monotone function larger than or equal to 驴 is an inherent ambiguityfunction. Both results are based on a more general theorem. Informallyit states that the loss of information induced bya length preserving homomorphism on an unambiguous context-free language can be turned into inherent ambiguity.