Acta Informatica

, Volume 14, Issue 3, pp 295–298 | Cite as

A note on the density of inherently ambiguous context-free languages



In this paper we give the first example of an inherently ambiguous context-free language with a non-algebraic density.


Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berstel J (1973) Sur la densité asymptotique des langages formels. In: Nivat M (ed), Automata, languages and programming. North-Holland, Amsterdam, p 345–358Google Scholar
  2. 2.
    Blumberg H (1926) Note on a theorem of Kempner concerning transcendental numbers. Bull Amer Math Soc 32: 351–356MATHGoogle Scholar
  3. 3.
    Gelfond AO (1960) Transcendental and algebraic numbers. Dover Publications, New YorkGoogle Scholar
  4. 4.
    Hall M (1967) Combinatorial theory. Blaisdell. Waltham, Mass., Toronto, LondonGoogle Scholar
  5. 5.
    Kuich W (1970) On the entropy of context-free languages. Information and Control. 16: 173–200CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Schneider TH (1957) Einführung in die Transzendenten Zahlen. Grundlehren der Mathematischen Wissenschaften, Band 81. Springer, Berlin Heidelberg New YorkGoogle Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • R. Kemp
    • 1
  1. 1.Fachbereich Angewandte Mathematik und InformatikUniversität des SaarlandesSaarbrückenGermany (Fed. Rep.)

Personalised recommendations