Abstract
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 Θ(n d) for each d ∈ N0. In this paper first examples of (linear) context-free languages with nonconstant sublinear ambiguity are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel. Transductions and Context-Free Languages. Teubner, 1979.
J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Formal Languages, and Computation. Addison-Wesley, 1979.
R. Kemp. A Note on the Density of Inherently Ambiguous Context-free Languages. Acta Informatica 14, pp. 295–298, 1980.
M. Naji. Grad der Mehrdeutigkeit kontextfreier Grammatiken und Sprachen. Diplomarbeit, FB Informatik, Johann-Wolfgang-Goethe-Universität, Frankfurt am Main, 1998.
K. Wich. Kriterien für die Mehrdeutigkeit kontextfreier Grammatiken. Diplomarbeit, FB Informatik, Johann-Wolfgang-Goethe-Universität, Frankfurt am Main, 1997.
K. Wich. Exponential Ambiguity of Context-free Grammars. Proc. 4th Int. Conf. on Developments in Language Theory’ 99, World Scientific, Singapore, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wich, K. (2000). Sublinear Ambiguity. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive